Related papers: Pl\"unnecke's Inequality
A seminal open question of Pisier and Mendel--Naor asks whether every degree-regular graph which satisfies the classical discrete Poincar\'e inequality for scalar functions, also satisfies an analogous inequality for functions taking values…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
In a recent work, Klartag gave an improved version of Lichnerowicz' spectral gap bound for uniformly log-concave measures, which improves on the classical estimate by taking into account the covariance matrix. We analyze the equality cases…
We discuss the Borel Tukey ordering on cardinal invariants of the continuum. We observe that this ordering makes sense for a larger class of cardinals than has previously been considered. We then provide a Borel version of a large portion…
Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…
Nonlinear Poincar\'e inequalities are indispensable tools in the study of dimension reduction and low-distortion embeddings of graphs into metric spaces, and have found remarkable algorithmic applications. A basic open problem, posed by Jon…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
The well-known Leibniz theorem (Leibniz Criterion or alternating series test) of convergence of alternating series is generalized for the case when the absolute value of terms of series are "not absolutely monotonously" convergent to zero.…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We derive the non-asymptotical non-uniform sharp error estimation for Bernstein's approximation of continuous function based on the modern probabilistic apparatus. We investigate also the convergence of derivative of these polynomials and…
The purpose of this paper is to study the Schwarz-Pick type inequalities for harmonic or pluriharmonic functions. By analogy with the generalized Khavinson conjecture, we first give some sharp estimates of the norm of harmonic functions…
Markov's inequality for algebraic polynomials on $\left[-1,1\right]$ goes back to more than a century and it is widely used in approximation theory. Its asymptotically sharp form for unions of finitely many intervals has been found only in…
We prove the equality case of the Penrose inequality in all dimensions for asymptotically flat hypersurfaces. It was recently proven by G. Lam that the Penrose inequality holds for asymptotically flat graphical hypersurfaces in Euclidean…
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There…
The main aim of this article is to establish a sharp improvement of the classical Bohr inequality for bounded holomorphic mappings in the polydisk $\mathbb{P}\Delta(0;1_n)$. We also prove two other sharp versions of the Bohr inequality in…
In this note it is established that, for any finite set $A$ of real numbers, there exist two elements $a,b \in A$ such that $$|(a+A)(b+A)| \gg \frac{|A|^2}{\log |A|}.$$ In particular, it follows that $|(A+A)(A+A)| \gg \frac{|A|^2}{\log…
We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…
We give the sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum_{k=0}^{n}a_kz^k$, $a_n\not=0,$ for the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ to be true for all $z\in\overline{\mathbb…