Related papers: The first Cheeger constant of a simplex
We study the problem of constructing a (near) uniform random proper $q$-coloring of a simple $k$-uniform hypergraph with $n$ vertices and maximum degree $\Delta$. (Proper in that no edge is mono-colored and simple in that two edges have…
We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…
Generalizing Chv\'atal's classic 1972 result, Ho\`ang proposed in 1995 the following conjecture, which strengthens Chv\'atal's result in terms of toughness: Let $t\ge 1$ be a positive integer and $G$ be a $t$-tough graph on $n \ge 3$…
We say that a first order formula $\Phi$ defines a graph $G$ if $\Phi$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of…
The purpose of this article is twofold. The first aim is to characterize $h$-extendibility of smoothly bounded pseudoconvex domains in $\mathbb C^{n+1}$ by their noncompact automorphism groups. Our second goal is to show that if the…
In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…
We carry on an analysis of the size of the contact surface of a Cheeger set $E$ with the boundary of its ambient space $\Omega$. We show that this size is strongly related to the regularity of $\partial \Omega$ by providing bounds on the…
The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: $$X_{n}=a_n+\sum_{j=1}^m b_j X_{\lfloor{\frac{n}{m_j}}\rfloor},$$ where the $m_i$'s are integers with $m_i\ge 2$. The main novelty of this…
We show that the natural Glauber dynamics mixes rapidly and generates a random proper edge-coloring of a graph with maximum degree $\Delta$ whenever the number of colors is at least $q\geq (\frac{10}{3} + \epsilon)\Delta$, where…
Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…
The Erd\H{o}s-Hooley Delta function is defined for $n\in\mathbb{N}$ as $\Delta(n)=\sup_{u\in\mathbb{R}} \#\{d|n : e^u<d\le e^{u+1}\}$. We prove that $\sum_{n\le x} \Delta(n) \ll x(\log\log x)^{11/4}$ for all $x\ge100$. This improves on…
In 2006, Ihara defined and systematically studied a generalization of the Euler-Mascheroni constant for all global fields, named the Euler-Kronecker constants. This paper examines their distribution across geometric quadratic extensions of…
Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $\chi_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or…
Given integer $k$ and a $k$-graph $F$, let $t_{k-1}(n,F)$ be the minimum integer $t$ such that every $k$-graph $H$ on $n$ vertices with codegree at least $t$ contains an $F$-factor. For integers $k\geq3$ and $0\leq\ell\leq k-1$, let…
In this work, in the Hilbert space of vector-functions L^2 (H,(-\infty,a)\cup(b,+\infty)),a<b all normal extensions of the minimal operator generated by linear singular formally normal differential expression l(\cdot)=(d/dt+A_1,d/dt+A_2)…
In this article, we investigate large prime factors of Fourier coefficients of non-CM normalized cuspidal Hecke eigenforms in short intervals. One of the new ingredients involves deriving an explicit version of Chebotarev density theorem in…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.
We find an explicit formula for the gamma vector in terms of the input polynomial in a way that extends it to arbitrary polynomials. More specifically, we find explicit linear combination in terms of coefficients of the input polynomial…