By making use of the Cauchy double alternant and the Laplace expansion formula, we establish two closed formulae for the determinants of factorial fractions that are then utilised to evaluate several determinants of binomial coefficients and Catalan numbers, including those obtained recently by Chammam [‘Generalized harmonic numbers, Jacobi numbers and a Hankel determinant evaluation’, Integral Transforms Spec. Funct. 30(7) (2019), 581–593].

We study a class of two-variable polynomials called exact polynomials which contains $A$-polynomials of knot complements. The Mahler measure of these polynomials can be computed in terms of a volume function defined on the vanishing set of the polynomial. We prove that the local extrema of the volume function are on the two-dimensional torus and give a closed formula for the Mahler measure in terms of these extremal values. This formula shows that the Mahler measure of an irreducible and exact polynomial divided by $\pi$ is greater than the amplitude of the volume function. We also prove a K-theoretic criterion for a polynomial to be a factor of an $A$-polynomial and give a topological interpretation of its Mahler measure.

We study intersections of orbits in polynomial semigroup dynamics with lines on the affine plane over a number field, extending previous work of D. Ghioca, T. Tucker, and M. Zieve (2008).

In this paper, we are interested in obtaining large values of Dirichlet L-functions evaluated at zeros of a class of L-functions, that is,

$$ \begin{align*}\max_{\substack{F(\rho)=0\\ T\leq \Im \rho \leq 2T}}L(\rho,\chi), \end{align*} $$

$\chi $

$GL(n)$

${\mathbb {Q}}$

Given $d\in \mathbb{N}$, we establish sum-product estimates for finite, nonempty subsets of $\mathbb{R}^{d}$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, nonempty set of $d\times d$ diagonal matrices with real entries. Then, for all $\unicode[STIX]{x1D6FF}_{1}<1/3+5/5277$,

$$\begin{eqnarray}|A+A|+|A\cdot A|\gg _{d}|A|^{1+\unicode[STIX]{x1D6FF}_{1}/d},\end{eqnarray}$$

Let p(n) denote the partition function. In this paper, we will prove that for $n\ges 222$,

$$\left| {\matrix{ {p(n)} & {p(n + 1)} & {p(n + 2)} \cr {p(n-1)} & {p(n)} & {p(n + 1)} \cr {p(n-2)} & {p(n-1)} & {p(n)} \cr } } \right| > 0.{\rm }$$

$n\ges 222$

$$(p(n)^2-p(n-1)p(n+1))^2-(p(n-1)^2-p(n-2)p(n))(p(n+1)^2-p(n)p(n+2))>0.$$

We prove that for every sufficiently large integer $n$, the polynomial $1+x+x^{2}/11+x^{3}/111+\cdots +x^{n}/111\ldots 1$ is irreducible over the rationals, where the coefficient of $x^{k}$ for $1\leqslant k\leqslant n$ is the reciprocal of the decimal number consisting of $k$ digits which are each $1$. Similar results following from the same techniques are discussed.

Lapkova [‘On the average number of divisors of reducible quadratic polynomials’, J. Number Theory 180 (2017), 710–729] uses a Tauberian theorem to derive an asymptotic formula for the divisor sum $\sum _{n\leq x}d(n(n+v))$ where $v$ is a fixed integer and $d(n)$ denotes the number of divisors of $n$. We reprove this result with additional terms in the asymptotic formula, by investigating the relationship between this divisor sum and the well-known sum $\sum _{n\leq x}d(n)d(n+v)$.

The aim of this note is to give a simple topological proof of the well-known result concerning continuity of roots of polynomials. We also consider a more general case with polynomials of a higher degree approaching a given polynomial. We then examine the continuous dependence of solutions of linear differential equations with constant coefficients.

Let $n\geq 1$ be an integer and $f$ be an arithmetical function. Let $S=\{x_{1},\ldots ,x_{n}\}$ be a set of $n$ distinct positive integers with the property that $d\in S$ if $x\in S$ and $d|x$. Then $\min (S)=1$. Let $(f(S))=(f(\gcd (x_{i},x_{j})))$ and $(f[S])=(f(\text{lcm}(x_{i},x_{j})))$ denote the $n\times n$ matrices whose $(i,j)$-entries are $f$ evaluated at the greatest common divisor of $x_{i}$ and $x_{j}$ and the least common multiple of $x_{i}$ and $x_{j}$, respectively. In 1875, Smith [‘On the value of a certain arithmetical determinant’, Proc. Lond. Math. Soc. 7 (1875–76), 208–212] showed that $\det (f(S))=\prod _{l=1}^{n}(f\ast \unicode[STIX]{x1D707})(x_{l})$, where $f\ast \unicode[STIX]{x1D707}$ is the Dirichlet convolution of $f$ and the Möbius function $\unicode[STIX]{x1D707}$. Bourque and Ligh [‘Matrices associated with classes of multiplicative functions’, Linear Algebra Appl. 216 (1995), 267–275] computed the determinant $\det (f[S])$ if $f$ is multiplicative and, Hong, Hu and Lin [‘On a certain arithmetical determinant’, Acta Math. Hungar. 150 (2016), 372–382] gave formulae for the determinants $\det (f(S\setminus \{1\}))$ and $\det (f[S\setminus \{1\}])$. In this paper, we evaluate the determinant $\det (f(S\setminus \{x_{t}\}))$ for any integer $t$ with $1\leq t\leq n$ and also the determinant $\det (f[S\setminus \{x_{t}\}])$ if $f$ is multiplicative.

We classify all polynomials $P(X)\in \mathbb{Q}[X]$ with rational coefficients having the property that the quotient $(\unicode[STIX]{x1D706}_{i}-\unicode[STIX]{x1D706}_{j})/(\unicode[STIX]{x1D706}_{k}-\unicode[STIX]{x1D706}_{\ell })$ is a rational number for all quadruples of roots $(\unicode[STIX]{x1D706}_{i},\unicode[STIX]{x1D706}_{j},\unicode[STIX]{x1D706}_{k},\unicode[STIX]{x1D706}_{\ell })$ with $\unicode[STIX]{x1D706}_{k}\neq \unicode[STIX]{x1D706}_{\ell }$.

For a finite field of odd cardinality $q$, we show that the sequence of iterates of $aX^{2}+c$, starting at $0$, always recurs after $O(q/\text{log}\log q)$ steps. For $X^{2}+1$, the same is true for any starting value. We suggest that the traditional “birthday paradox” model is inappropriate for iterates of $X^{3}+c$, when $q$ is 2 mod 3.

In this paper we give an extension of the results of the generalized waiting time problem given by El-Desouky and Hussen (1990). An urn contains m types of balls of unequal numbers, and balls are drawn with replacement until first duplication. In the case of finite memory of order k, let ni be the number of type i, i = 1, 2, …, m. The probability of success pi = ni/N, i = 1, 2, …, m, where ni is a positive integer and Let Ym,k be the number of drawings required until first duplication. We obtain some new expressions of the probability function, in terms of Stirling numbers, symmetric polynomials, and generalized harmonic numbers. Moreover, some special cases are investigated. Finally, some important new combinatorial identities are obtained.

We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve a min–max–min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we show that this optimality also holds for a large class of potentials, including the Riesz potentials $1/r^{s}$ with $s>0.$

In 1903 Mirimanoff conjectured that Cauchy–Mirimanoff polynomials En are irreducible over ℚ for odd prime n. Polynomials Rn, Sn, Tn are introduced, closely related to En. It is proved that Rm, Sm, Tm are irreducible over ℚ for odd m≥3 , and En, Rn, Sn are irreducible over ℚ, for n=2qm, q=1,2,3,4,5 , and m≥1 odd.

We prove the conjecture formulated in Litvak and Ejov (2009), namely, that the trace of the fundamental matrix of a singularly perturbed Markov chain that corresponds to a stochastic policy feasible for a given graph is minimised at policies corresponding to Hamiltonian cycles.

Let G be a subgroup of the symmetric group Sn, and let δG=∣Sn/G∣−1 where ∣Sn/G∣ is the index of G in Sn. Then there are at most On,ϵ(Hn−1+δG+ϵ) monic integer polynomials of degree n that have Galois group G and height not exceeding H, so there are only a “few” polynomials having a “small” Galois group.

We refine a result of Dubickas on the maximal multiplicity of the roots of a complex polynomial, and obtain several separability criteria for complex polynomials with large leading coefficient. We also give p-adic analogous results for polynomials with integer coefficients.

Let α be a totally positive algebraic integer of degree d≥2 and α1=α,α2,…,αd be all its conjugates. We use explicit auxiliary functions to improve the known lower bounds of Sk/d, where Sk=∑ di=1αki and k=1,2,3. These improvements have consequences for the search of Salem numbers with negative traces.