相关论文: On a number of rational points on a convex curve
Erd\H{o}s and Hajnal proposed a problem that: is it true that every $(2n+1)$-vertex graph with $n^2+n+1$ edges contains two vertices of equal degree connected by a path of length three? The edge bound is sharp by the complete bipartite…
It is known that random convex polygonal lines on $\mathbb{Z}_+^2$ (with the endpoints fixed at $0=(0,0)$ and $n=(n_1,n_2)\to\infty$) have a limit shape with respect to the uniform probability measure, identified as the parabola arc…
Geschke proved that there is clopen graph on $2^\omega$ which is 3-saturated, but the clopen graphs on $2^\omega$ do not even have infinite subgraphs that are 4-saturated; however there is $F_\sigma$ graph that is $\omega_1$-saturated. It…
Let H:(M,p)->(M',p') be a formal mapping between two germs of real-analytic generic submanifolds in C^N with nonvanishing Jacobian. Assuming M to be minimal at p and M' holomorphically nondegenerate at p', we prove the convergence of the…
In previous work, the first author obtained conjecturally sharp upper bounds for the joint moments of the $(2k-2h)^{\text{th}}$ power of the Riemann zeta function with the $2h^{\text{th}}$ power of its derivative on the critical line in the…
We consider a continuously differentiable curve $t\mapsto \gamma(t)$ in the space of $2n\times 2n$ real symplectic matrices, which is the solution of the following ODE: $\frac{\mathrm{d}\gamma}{\mathrm{d}t}(t)=J_{2n}A(t)\gamma(t),…
In this note we point out that the limit shape of the Jarnk polygonal curve [1] is the circle, not a curve consisting of arcs of parabolas as it has been stated in the main result of [2] (Section 2). The correct result has been established…
We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…
We establish a quantitative version of Oppenheim's conjecture for generic ternary indefinite quadratic forms using an analytic number theory approach. The statements come with power gains and in some cases are essentially optimal
A graph is called diameter-$k$-critical if its diameter is $k$, and the removal of any edge strictly increases the diameter. In this paper, we prove several results related to a conjecture often attributed to Murty and Simon, regarding the…
Let $\bar{S}$ denote the set of integers $n$ such that $n!$ cannot be written as a sum of three squares. Let $\bar{S}(n)$ denote $\bar{S} \cap [1, n]$. We establish an exact formula for $\bar{S}(2^k)$ and show that $\bar{S}(n) = 1/8*n +…
The following theorem is proved: Let M be a locally Lipschitz hypersurface in C^n with one-sided extension property at each point (e.g., without analytic discs). Let S be a closed subset of M and f : M \ S ---> C^m \ E is a CR-mapping of…
We show that for any claw-free graph $G$ and any graph $H$, $\gamma(G\square H)\geq \frac{2}{3}\gamma(G)\gamma(H)$, where $\gamma(G)$ is the domination number of $G$.
Let $Y$ be the complement of a plane quartic curve $D$ defined over a number field. Our main theorem confirms the Lang-Vojta conjecture for $Y$ when $D$ is a generic smooth quartic curve, by showing that its integral points are confined in…
The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…
A counterexample is given for the Knaster-like conjecture of Makeev for functions on $S^2$. Some particular cases of another conjecture of Makeev, on inscribing a quadrangle into a smooth simple closed curve, are solved positively.
Kippenhahn discovered a real algebraic plane curve whose convex hull is the numerical range of a matrix. The correctness of this theorem was called into question when Chien and Nakazato found an example where the spatial analogue fails.…
The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…
Given a metric $\gamma$ of nonnegative Gauss curvature and a positive function $H$ on a $2$-sphere $\Sigma$, we estimate the Bartnik quasi-local mass of $(\Sigma, \gamma, H)$ in terms of the area, the total mean curvature, and a quantity…