Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe $q$-analog of the Markoff injectivity conjecture holds over the language of a balanced sequence
98
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The Markoff injectivity conjecture states that $wmapstomu(w)_{12}$ is injective on the set of Christoffel words where $mu:{mathtt{0},mathtt{1}}^*tomathrm{SL}_2(mathbb{Z})$ is a certain homomorphism and $M_{12}$ is the entry above the diagonal of a $2times2$ matrix $M$. Recently, Leclere and Morier-Genoud (2021) proposed a $q$-analog $mu_q$ of $mu$ such that $mu_{qto1}(w)=mu(w)$ is the Markoff number associated to the Christoffel word $w$. We show that for every $q>0$, the map ${mathtt{0},mathtt{1}}^*tomathbb{Z}[q]$ defined by $wmapstomu_q(w)_{12}$ is injective over the language $mathcal{L}(s)$ of a balanced sequence $sin{mathtt{0},mathtt{1}}^mathbb{Z}$. The proof is based on new equivalent definitions of balanced sequences.
rate research
Read More
Fugledes conjecture in $mathbb{Q}_p$ is proved. That is to say, a Borel set of positive and finite Haar measure in $mathbb{Q}_p$ is a spectral set if and only if it tiles $mathbb{Q}_p$ by translation.
We establish a congruence on sums of central $q$-binomial coefficients. From this $q$-congruence, we derive the divisibility of the $q$-trinomial coefficients introduced by Andrews and Baxter.
We use a weight-preserving, sign-reversing involution to find a combinatorial expansion of $Delta_{e_k} e_n$ at $q=1$ in terms of the elementary symmetric function basis. We then use a weight-preserving bijection to prove the Delta Conjecture at $q=1$. The method of proof provides a variety of structures which can compute the inner product of $Delta_{e_k} e_n|_{q=1}$ with any symmetric function.
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if $log r / log s$ is irrational and $X$ and $Y$ are $times r$- and $times s$-invariant subsets of $[0,1]$, respectively, then $dim_text{H} (X+Y) = min ( 1, dim_text{H} X + dim_text{H} Y)$. Our main result yields information on the size of the sumset $lambda X + eta Y$ uniformly across a compact set of parameters at fixed scales. The proof is combinatorial and avoids the machinery of local entropy averages and CP-processes, relying instead on a quantitative, discrete Marstrand projection theorem and a subtree regularity theorem that may be of independent interest.
Let $G$ be a finite cyclic group of order $n ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)cdot ... cdot (n_lg)$ where $gin G$ and $n_1,..., n_l in [1,ord(g)]$, and the index $ind (S)$ of $S$ is defined as the minimum of $(n_1+ ... + n_l)/ord (g)$ over all $g in G$ with $ord (g) = n$. In this paper we prove that a sequence $S$ over $G$ of length $|S| = n$ having an element with multiplicity at least $frac{n}{2}$ has a subsequence $T$ with $ind (T) = 1$, and if the group order $n$ is a prime, then the assumption on the multiplicity can be relaxed to $frac{n-2}{10}$. On the other hand, if $n=4k+2$ with $k ge 5$, we provide an example of a sequence $S$ having length $|S| > n$ and an element with multiplicity $frac{n}{2}-1$ which has no subsequence $T$ with $ind (T) = 1$. This disproves a conjecture given twenty years ago by Lemke and Kleitman.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
