English
Related papers

Related papers: On quantitative aspects of trace polynomials

200 papers

We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high…

Group Theory · Mathematics 2019-02-20 Danny Calegari , Joseph Maher

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

Number Theory · Mathematics 2021-08-05 Thomas C. Martinez , Steven J. Miller , Clayton Mizgerd , Chenyang Sun

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Number Theory · Mathematics 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…

Dynamical Systems · Mathematics 2018-03-01 C. Mauduit , C. -G. Moreira

To a non-trivial word $w(x_{1},...,x_{r})$ in a free group $F_{r}$ on $r$ elements and a group $G$, one can associate the word map $w_{G}:G^{r}\rightarrow G$ that takes an $r$-tuple $(g_{1},...,g_{r})$ in $G^{r}$ to $w(g_{1},...,g_{r})$. If…

Group Theory · Mathematics 2024-02-20 Nir Avni , Itay Glazer , Michael Larsen

We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to…

Group Theory · Mathematics 2013-12-23 M. Elder , A. Rechnitzer , E. J. Janse van Rensburg , T. Wong

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

Let $m$ be a positive integer larger than $1$, let $w$ be a finite word over $\left\{0,1,...,m-1\right\}$ and let $a_{m;w}(n)$ be the number of occurrences of the word $w$ in the $m$-expansion of $n$ mod $p$ for any non-negative integer…

Combinatorics · Mathematics 2023-05-01 Antoine Abram , Yining Hu , Shuo Li

Let $F_1,\ldots,F_R$ be homogeneous polynomials with integer coefficients in $n$ variables with differing degrees. Write $\boldsymbol{F}=(F_1,\ldots,F_R)$ with $D$ being the maximal degree. Suppose that $\boldsymbol{F}$ is a nonsingular…

Number Theory · Mathematics 2024-05-13 Jianya Liu , Sizhe Xie

For any choice of a basis $\cal A$ the free group $F_N$ of finite rank $N \geq 2$ can be canonically identified with the set $F(\cal A)$ of reduced words in $\cal A\cup \cal A^{-1}$. However, such a word $w \in F(\cal A)$ admits a second…

Group Theory · Mathematics 2013-06-25 Fedaa Ibrahim , Martin Lustig

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…

Classical Analysis and ODEs · Mathematics 2019-02-07 Julian Sahasrabudhe

In this paper we derive a formula for the number of $N$-free elements over a finite field $\mathbb{F}_q$ with prescribed trace, in particular trace zero, in terms of Gaussian periods. As a consequence, we derive a simple explicit formula…

Number Theory · Mathematics 2015-08-13 Aleksandr Tuxanidy , Qiang Wang

In this paper we study the asymptotic distribution of the moments of (non-normalized) traces $\Tr (w_1), \Tr(w_2), ..., \Tr(w_r)$, where $ w_1, w_2, >..., w_r$ are reduced words in unitaries in the group $\cU(N)$. We prove that as $N\to…

Operator Algebras · Mathematics 2007-05-23 Florin Radulescu

Let $F= < a,b>$ be a rank two free group. A word $W(a,b)$ in $F$ is {\sl primitive} if it, along with another group element, generates the group. It is a {\sl palindrome} (with respect to $a$ and $b$) if it reads the same forwards and…

Group Theory · Mathematics 2011-02-15 Jane Gilman , Linda Keen

We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…

Group Theory · Mathematics 2013-07-09 Danny Calegari , Alden Walker

In this paper we show that the leading coefficient $\mu(y,w)$ of some Kazhdan-Lusztig polynomials $P_{y,w}$ with $y,w$ in an affine Weyl group of type $\tilde B_n$ (resp. $\tilde C_n$ or $\tilde D_n$) is $n$ (resp. $n+1$).

Representation Theory · Mathematics 2025-09-09 Pan Chen

Let $w$ be a word in the free group on $r$ generators. The expected value of the trace of the word in $r$ independent Haar elements of $\mathrm{O}(n)$ gives a function ${\cal T}r_{w}^{\mathrm{O}}(n)$ of $n$. We show that ${\cal…

Geometric Topology · Mathematics 2022-12-27 Michael Magee , Doron Puder

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of various well-studied classes of "structured" $\mathbb{F}_2$-polynomials. This study is motivated by applications in pseudorandomness, in…

Computational Complexity · Computer Science 2024-10-15 Jarosław Błasiok , Peter Ivanov , Yaonan Jin , Chin Ho Lee , Rocco A. Servedio , Emanuele Viola

Let s 1 ,. .. , s k be the elementary symmetric functions of the complex variables x 1 ,. .. , x k. We say that F $\in$ C[s 1 ,. .. , s k ] is a trace function if their exists f $\in$ C[z] such that F (s 1 ,. .. , s k ] = k j=1 f (x j) for…

Algebraic Geometry · Mathematics 2019-11-22 Daniel Barlet

The objective of this manuscript is to study directly the Favard type theorem associated with the three term recurrence formula % \[ R_{n+1}(z) = \big[(1+ic_{n+1})z+(1-ic_{n+1})\big] R_{n}(z) - 4 d_{n+1} z R_{n-1}(z), \quad n \geq 1, \] %…

Classical Analysis and ODEs · Mathematics 2015-10-26 Kenier Castillo , Marisa Costa , A. Sri Ranga , Daniel Veronese