相关论文: On combinatorial compexity of convex sequences

It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

We solve two long-standing open problems on word equations. Firstly, we prove that a one-variable word equation with constants has either at most three or an infinite number of solutions. The existence of such a bound had been conjectured,…

We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…

Let $a,b,c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this paper, combining the Gel'fond-Baker method with an elementary approach, we prove that if $\max\{a,b,c\}>5\times 10^{27}$, then the equation $a^x+b^y=c^z$ has at…

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

For a fixed $c > 0$ we construct an arbitrarily large set $B$ of size $n$ such that its sum set $B+B$ contains a convex sequence of size $cn^2$, answering a question of Hegarty.

We obtain some new inequalities between the ordinary and the uniform Diophantine exponents for simultaneous Diophantine approximation to four real numbers.

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…

We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath…

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…

For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence…

We study the density of solutions to Diophantine inequalities involving non-singular ternary forms, or equivalently, the density of rational points close to non-singular plane algebraic curves.

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

We study multiplicative Diophantine approximation property of vectors and compute Diophantine exponents of hyperplanes via dynamics.

We prove a new quantitative result on the degeneracy of the dimension of the subspace spanned by the best Diophantine approximations for a linear form.

We show the existence of $n$-complements for generalized pairs with additional Diophantine approximation properties when the coefficients of boundaries belong to a DCC set.

We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…