相关论文: Strange Expectations

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

The $abc$ conjecture states that there are only finitely many triples of coprime positive integers $(a,b,c)$ such that $a+b=c$ and $\operatorname{rad}(abc) < c^{1-\epsilon}$ for any $\epsilon > 0$. Using the optimized methods in a recent…

Fix a container polygon $P$ in the plane and consider the convex hull $P_n$ of $n\geq 3$ independent and uniformly distributed in $P$ random points. In the focus of this paper is the vertex number of the random polygon $P_n$. The precise…

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…

Let $P$ be a set of $n$ points in the plane, where each element of $P$ is assigned a weight $\omega(p)$, positive or negative. In this paper, we present an algorithm that runs in $O(n^4\log n)$ time and $O(n)$ space to find two possibly…

In this paper we present a novel approach in extremal set theory which may be viewed as an asymmetric version of Katona's permutation method. We use it to find more Tur\'an numbers of hypergraphs in the Erd\H{o}s--Ko--Rado range. An…

For an orientation $H$ with $n$ vertices, let $T(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex tournament. It is easily seen that $T(H) \ge n!/2^{e(H)}$ as the latter is the expected number of such copies…

We consider the occupancy problem where balls are thrown independently at infinitely many boxes with fixed positive frequencies. It is well known that the random number of boxes occupied by the first n balls is asymptotically normal if its…

As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…

Resolving a conjecture of Bollob\'{a}s and Erd\H{o}s, Gy\'{a}rf\'{a}s proved that every graph $G$ of chromatic number $k+1\geq 3$ contains cycles of $\lfloor\frac{k}{2}\rfloor$ distinct odd lengths. We strengthen this prominent result by…

We analyze the asymptotic behavior of the average maximal number of balls in a bin obtained by throwing uniformly at random $r$ balls without replacement into $n$ bins, $T$ times. Writing the expected maximum as $\frac{r}{n}T+…

Woodall proved that for a graph $G$ of order $n\geq 2k+3$ where $k\geq 0$ is an integer, if $e(G)\geq \binom{n-k-1}{2}+\binom{k+2}{2}+1$ then $G$ contains a $C_{\ell}$ for each $\ell\in [3,n-k]$. In this article, we prove a stability result…

In this paper, we prove that every pair of sufficiently large odd integers can be represented in the form of a pair of one prime, four prime cubes and $48$ powers of $2$.

Simultaneous core partitions have been widely studied since Anderson's work on the enumeration of $(s,t)$-core partitions. Amdeberhan and Leven showed that the number of $(s,s+1, \ldots, s+k)$-core partitions is equal to the number of $(s,…

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

Consider a finite field $\mathbb{F}_q$ and positive integers $d,m,r$ with $1\leq r\leq \binom{m+d}{d}$. Let $S_d(m)$ be the $\mathbb{F}_q$ vector space of all homogeneous polynomials of degree $d$ in $X_0,\dots,X_m$. Let $e_r(d,m)$ be the…

For positive integers $n$ and $r$, we consider $n$-vertex graphs with the maximum number of $r$-edge-colorings with no copy of a triangle where exactly two colors appear. We prove that, if $2 \leq r \leq 26$ and $n$ is sufficiently large,…

A conjecture on the monotonicity of t-core partitions in an article of Stanton [Open positivity conjectures for integer partitions, Trends Math., 2:19-25, 1999] has been the catalyst for much recent research on t-core partitions. We…

In 2016, Nath and Sellers proposed a conjecture regarding the precise largest size of ${(s,ms-1,ms+1)}$-core partitions. In this paper, we prove their conjecture. One of the key techniques in our proof is to introduce and study the…