English
Related papers

Related papers: A $q$-analog of the Markoff injectivity conjecture…

200 papers

The Markoff injectivity conjecture states that $w\mapsto\mu(w)_{12}$ is injective on the set of Christoffel words where $\mu:\{\mathtt{0},\mathtt{1}\}^*\to\mathrm{SL}_2(\mathbb{Z})$ is a certain homomorphism and $M_{12}$ is the entry above…

Combinatorics · Mathematics 2022-04-15 Sébastien Labbé , Mélodie Lapointe

We introduce a family of modules, called Markoff modules, generated by a cluster-mutation-like iterative process. We show that these modules are combinatorially similar to Christoffel words. Furthermore, we construct a bijective map between…

Representation Theory · Mathematics 2011-11-15 Alex Lasnier

Markoff triples are parametrized uniquely by Christoffel words.

Number Theory · Mathematics 2008-09-22 Christophe Reutenauer

We define Markoff words as certain factors appearing in bi-infinite words satisfying the Markoff condition. We prove that these words coincide with central words, yielding a new characterization of Christoffel words.

Combinatorics · Mathematics 2007-08-31 Amy Glen , Aaron Lauve , Franco V. Saliola

The trapezoidal Fox conjecture states that the coefficient sequence of the Alexander polynomial of an alternating knot is unimodal. We are motivated by a harder question, the strong Fox conjecture, which asks whether the coefficient…

Geometric Topology · Mathematics 2022-12-12 Ian M. Banfield

In 2013, Darryl McCullough and Marcus Wanderley made a series of conjectures that describe the Nielsen equivalence classes and $T_2$-equivalence classes of pairs of generators for $\text{SL}_2(\mathbb{F}_q)$ and the Markoff equivalence…

Number Theory · Mathematics 2025-11-24 Daniel E. Martin

Initially stated in terms of Beatty sequences, the Fraenkel conjecture can be reformulated as follows: for a $k$-letter alphabet A, with a fixed $k \geq 3$, there exists a unique balanced infinite word, up to letter permutations and shifts,…

Combinatorics · Mathematics 2010-04-13 Geneviève Paquin , Christophe Reutenauer

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

Probability · Mathematics 2010-11-11 Alexander Gnedin , Grigori Olshanski

Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…

Information Theory · Computer Science 2010-06-03 Siu-Wai Ho

We propose a conjectural $q$-analogue of the classical duality for iterated integrals on $\mathbb{P}^{1}$ minus four points, arising from the involutive M\"{o}bius transformation which exchanges the four marked points in pairs. To this end,…

Number Theory · Mathematics 2026-05-04 Minoru Hirose

We use an injection method to prove a new class of partition inequalities involving certain $q$-products with two to four finitization parameters. Our new theorems are a substantial generalization of work by Andrews and of previous work by…

Combinatorics · Mathematics 2013-11-22 Alexander Berkovich , Keith Grizzell

Matrix-valued covariance extension and multivariate spectral estimation are formulated as generalized moment problems in the "THREE" approach and its extensions. Under this context, we discuss Theorem 6 in \cite{Georgiou-06} concerning the…

Optimization and Control · Mathematics 2019-08-08 Bin Zhu

A triple (a,b,c) of positive integers is called a Markoff triple iff it satisfies the diophantine equation a2 + b2 + c2 = abc . Recasting the Markoff tree, whose vertices are Markoff triples, in the framework of intergral upper triangular…

Number Theory · Mathematics 2013-04-01 Norbert Riedel

We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…

Combinatorics · Mathematics 2024-08-01 Swee Hong Chan , Igor Pak

The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for $C^1$ maps is explored here. Some results known in the polynomial case…

Algebraic Geometry · Mathematics 2007-05-23 L. Andrew Campbell

We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two Sturmian words with the same language have (almost always)…

Discrete Mathematics · Computer Science 2013-07-12 Michelangelo Bucci , Alessandro De Luca , Luca Q. Zamboni

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…

Combinatorics · Mathematics 2016-03-04 Francesco Marigo , Davide Schipani

One of the aims of this article is to provide a class of polynomial mappings for which the Jacobian conjecture is true. Also, we state and prove several global univalence theorems and present a couple of applications of them.

Complex Variables · Mathematics 2017-06-01 Saminathan Ponnusamy , Victor V. Starkov

We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of determining if the acceptance probability function of a…

Formal Languages and Automata Theory · Computer Science 2021-07-01 Paul C. Bell , Mika Hirvensalo

We study an extension to the uniqueness conjecture for Markov numbers. For any three positive integers $m\geq a$ and $m\geq b$ satisfying $a^2+b^2+m^2=3abm$, this conjecture states that the triple $(a,m,b)$ is uniquely determined by the…

Number Theory · Mathematics 2019-11-05 Matty van Son
‹ Prev 1 2 3 10 Next ›