Related papers: The critical exponent of the Arshon words

The leading order term for the average, over quadratic discriminants satisfying the so-called Heegner condition, of the Neron-Tate height of Heegner points on a rational elliptic curve E has been determined in [12]. In addition, the second…

We give constructions of n^k x n^k x n tensors of rank at least 2n^k - O(n^(k-1)). As a corollary we obtain an [n]^r shaped tensor with rank at least 2n^(r/2) - O(n^(r/2)-1) when r is odd. The tensors are constructed from a simple recursive…

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…

Our main theorem is that the word problem in the Artin group G = <a,b,c | aba=bab, ac=ca, {}_{n}(b,c) = {}_{n}(c,b) > for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be…

Word ${\mathbf G}$ is the fixed point of the morphism $\gamma=[01,2,02]$. In 2019, Shallit and Shur showed that ${\mathbf G}$ has factor complexity $2n+1$. They also showed that ${\mathbf G}$ has critical exponent…

We define and investigate the property of being `exponent-critical' for a finite group. A finite group is said to be exponent-critical if its exponent is not the least common multiple of the exponents of its proper non-abelian subgroups. We…

We are interested in the maximal number of distinct squares in a word. This problem was introduced by Fraenkel and Simpson, who presented a bound of 2n for a word of length n, and conjectured that the bound was less than n. Being that the…

The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded above by [n/6]-2. We find that there are no fullerenes whose…

For two-dimensional percolation at criticality, we discuss the inequality $\alpha_4 > 1$ for the polychromatic four-arm exponent (and stronger versions, the strongest so far being $\alpha_4 \geq 1 + \frac{\alpha_2}{2}$, where $\alpha_2$…

We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the…

The largest components of the critical Erd\H{o}s-R\'enyi graph, $G(n,p)$ with $p=1/n$, have size of order $n^{2/3}$ with high probability. We give detailed asymptotics for the probability that there is an unusually large component, i.e. of…

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…

We show that for every rational number $r \in (1,2)$ of the form $2 - a/b$, where $a, b \in \mathbb{N}^+$ satisfy $\lfloor b/a \rfloor^3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$, there exists a graph $F_r$ such that the Tur\'an number…

We investigate critical polyharmonic equations of the following type: $$ Lu = |u|^{2^\sharp-2} u \quad \text{ in } \Omega $$ with Dirichlet boundary conditions, in a smooth bounded domain $\Omega$ of $\mathbb{R}^n$. Here $L$ is an elliptic…

The first two authors have shown [KK99,KK00] that the sum the exponent (and thus the number) of maximal repetitions of exponent at least 2 (also called runs) is linear in the length of the word. The exponent 2 in the definition of a run may…

We consider the Cauchy problem of the semilinear wave equation with a damping term \begin{align*} u_{tt} - \Delta u + c(t,x) u_t = |u|^p, \quad (t,x)\in (0,\infty)\times \mathbb{R}^N,\quad u(0,x) = \varepsilon u_0(x), \ u_t(0,x) =…

In this paper, we find an upper bound for the exponent of the Schur multiplier of a pair $(G,N)$ of finite $p$-groups, when $N$ admits a complement in $G$. As a consequence, we show that the exponent of the Schur multiplier of a pair…

In combinatorics on words, a word w of length n over an alphabet of size q is said to be privileged if n <= 1 or if n >= 2 and w has a privileged border that occurs exactly twice in w. Forsyth, Jayakumar and Shallit proved that there exist…

We study the $L^p$ concentration problem for the Born--Jordan distribution in dimension $d>1$, thus extending the one-dimensional analysis in [Stra-Svela-Trapasso, J. Math. Pures Appl. (2026)]. We show that the existence of concentration…