Convexity and Aigner's Conjectures

k-马尔科夫数的序

Orderings of k-Markov Numbers

本文研究k-马尔科夫数的序问题，证明其满足Aigner的猜想，基于簇代数理论。

An asymmetric random Rado theorem for single equations: the $0$-statement

A famous result of Rado characterises those integer matrices $A$ which are partition regular, i.e. for which any finite colouring of the positive integers gives rise to a monochromatic solution to the equation $Ax=0$. Aigner-Horev and Person recently stated a conjecture on the probability threshold for the binomial random set $[n]_p$ having the asymmetric random Rado property: given partition regular matrices $A_1, \dots, A_r$ (for a fixed $r \geq 2$), however one $r$-colours $[n]_p$, there is always a colour $i \in [r]$ such that there is an $i$-coloured solution to $A_i x=0$. This generalise…

On the Markov numbers: fixed numerator, denominator, and sum conjectures

The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and useful) to index the Markov numbers by the rationals between 0 and 1 which stand at the same place in the Stern-Brocot binary tree. The Frobenius conjecture claims that each Markov number appears at most once in the tree. In particular, if the conjecture is true, the order of Markov numbers would establish a new strict order on the rationals. Aigner suggested thre…

Continued fractions and orderings on the Markov numbers

Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as combinatorics, hyperbolic geometry, approximation theory and cluster algebras. There is a natural map from the rational numbers between zero and one to the Markov numbers. In this paper, we prove two conjectures seen in Martin Aigner's book, Markov's theorem and 100 years of the uniqueness conjecture, that determine an ordering on subsets of the Markov numbe…

Asymptotic equidistribution and convexity for partition ranks

We study the Dyson rank function $N(r,t;n)$, the number of partitions with rank congruent to $r$ modulo $t$. We first show that it is monotonic in $n$, and then show that it equidistributed as $n \rightarrow \infty$. Using this result we prove a conjecture of Hou and Jagadeeson on the convexity of $N(r,t;n)$.

Pinch 关于 $a$-凸性的猜想

Pinch's conjecture on $a$-convexity

本文证明了 Pinch 关于 $a$-凸性的猜想：若 $a$ 为全实代数整数且 $D(a)$ 无极限点，则 $a$ 的其他代数共轭均位于 $(0,1)$ 内。