相关论文: A note on the Hitczenko-Kwapien conjecture about a…

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

For all $k\geq 2$, we provide almost-sharp quantitative results for the $k$-dimensional Duffin-Schaeffer conjecture, analogous to recent developments in the 1-D case of Koukoulopoulos-Maynard-Yang. In particular, for…

By a classical result of Kadec and Pe\l czynski (1962), every normalized weakly null sequence in $L^p$, $p>2$ contains a subsequence equivalent to the unit vector basis of $\ell^2$ or to the unit vector basis of $\ell^p$. In this paper we…

Let $v_1,v_2,...,v_n$ be real numbers whose squares add up to $1$. Consider the $2^n$ signed sums of the form $S=\sum_{i=1}^n \pm v_i.$ Holzman and Kleitman (1992) proved that at least $\frac38=0.375$ of these sums satisfy $|S|\leq 1.$ By…

We obtained a $\psi_1$ estimate for the sum of Rademacher random variables under condition that they are dependent.

Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…

The Blaschke's conjecture asserts that if $\diam(M)=\text{Inj}(M)=\frac\pi2$ (up to a rescaling) for a complete Riemannian manifold $M$, then $M$ is isometric to $\Bbb S^n(\frac12)$, ${\Bbb R\Bbb P}^{n}$, ${\Bbb C\Bbb P}^{n}$, ${\Bbb H\Bbb…

The sparse analogue of Szemer\'edi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR conjecture) has been resolved, the corresponding sparse…

Inequalities among symmetric polynomial functions are fundamental questions in mathematics and have various applications in science and engineering. This paper investigates a beautiful and inspiring conjecture, proposed by Cuttler, Greene…

Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following conjecture. \noindent\textbf{Conjecture}. {\it Let $D$ be a 2-strongly connected digraph of order $n$ such that for all distinct pairs of non-adjacent vertices $x$, $y$…

The Kochen-Specker theorem proves the inability to assign, simultaneously, noncontextual definite values to all (of a finite set of) quantum mechanical observables in a consistent manner. If one assumes that any definite values behave…

In "IP-sets and polynomial recurrence", Bergelson, Furstenberg, and McCutcheon established the following far reaching extension of Khintchine's recurrence theorem: For any invertible probability preserving system $(X,\mathcal A,\mu,T)$, any…

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

By probabilistic means, the concept of contextuality is extended so that it can be used in non-ideal situations. An inequality is presented, which at least in principle enables a test to discard non-contextual hidden-variable models at low…

We prove versions of Khintchine's Theorem (1924) for approximations by rational numbers whose numerators lie in randomly chosen sets of integers, and we explore the extent to which the monotonicity assumption can be removed. Roughly…

Let $G$ be a $k$-connected graph on $n$ vertices. Hippchen's Conjecture states that two longest paths in $G$ share at least $k$ vertices. Guti\'errez recently proved the conjecture when $k\leq 4$ or $k\geq \frac{n-2}{3}$. We improve upon…

The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…