Related papers: A boundedness conjecture for minimal log discrepan…

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

We obtain, under an additional assumption on the subanalytic abnormal distribution constructed in [4], a proof of the minimal rank Sard conjecture in the analytic category. It establishes that from a given point the set of points accessible…

Consider a matrix $A$ of rank $n$ that approximates the $N\times N$ identity matrix with elementwise error at most $1/3$. We give a lower bound on the number of elements s.t. $|A_{i,j}|>\gamma$, for a certain threshold. Two corollaries are…

In this paper, we construct a moment inequality for mixing dependent random variables, it is of independent interest. As applications, the consistency of the kernel density estimation is investigated. Several limit theorems are established:…

A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals…

Gerth generalised Cohen-Lenstra heuristics to the prime $p=2$. He conjectured that for any positive integer $m$, the limit $$ \lim_{x \to \infty} \frac{\sum_{0 < D \le X, \atop{ \text{squarefree} }} |{\rm Cl}^2_{\Q(\sqrt{D})}/{\rm…

We prove that the order of a finite group $G$ with trivial solvable radical is bounded above in terms of ${\rm acd}(G)$, the average degree of the irreducible characters. It is not true that the index of the Fitting subgroup is bounded…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

Malle proposed a conjecture for counting the number of $G$-extensions $L/K$ with discriminant bounded above by $X$, denoted $N(K,G;X)$, where $G$ is a fixed transitive subgroup $G\subset S_n$ and $X$ tends towards infinity. We introduce a…

In this paper, we investigate the problem of separating a set $X$ of points in $\mathbb{R}^{2}$ with an arrangement of $K$ lines such that each cell contains an asymptotically equal number of points (up to a constant ratio). We consider a…

A conic bundle is a contraction $X\to Z$ between normal varieties of relative dimension $1$ such that $-K_X$ is relatively ample. We prove a conjecture of Shokurov which predicts that, if $X\to Z$ is a conic bundle such that $X$ has…

We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency $d^{-o_d(1)}$. When the dimension is large enough, our lower bound is tighter than the previous…

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

We classify the finite groups with the property that any two different character codegrees are coprime. In general, we conjecture that if $k$ is a positive integer such that for any prime $p$ the number of character codegrees of a finite…

Let $(X,B)$ be a pair, and let $f \colon X \rightarrow S$ be a contraction with $-(K_X + B)$ nef over $S$. A conjecture, known as the Shokurov-Koll\'{a}r connectedness principle, predicts that $f^{-1} (s) \cap \mathrm{Nklt}(X,B)$ has at…

For each $r\ge 4$, we show that any graph $G$ with minimum degree at least $(1-1/100r)|G|$ has a fractional $K_r$-decomposition. This improves the best previous bounds on the minimum degree required to guarantee a fractional…

It is conjectured since long that for any convex body $K \in \mathbb{R}^n$ there exists a point in the interior of $K$ which belongs to at least $2n$ normals from different points on the boundary of $K$. The conjecture is known to be true…

We consider the problem of quickest changepoint detection under the Average Run Length (ARL) constraint where the pre-change and post-change laws lie in composite families $\mathscr{P}$ and $\mathscr{Q}$ respectively. In such a problem, a…

Minimal log discrepancies (mld's) are related not only to termination of log flips, and thus to the existence of log flips but also to the ascending chain condition (acc) of some global invariants and invariants of singularities in the Log…

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…