相关论文: Tight Lower Bounds for Unequal Division

We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for…

Let $\pi$ be a Hecke-Maass cusp form for $SL(3,\mathbb Z)$ and $f$ be a holomorphic (or Maass) Hecke form for $SL(2,\mathbb{Z})$. In this paper we prove the following subconvex bound $$ L\left(\tfrac{1}{2}+it,\pi\times…

We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…

It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…

We consider a setting in which a single divisible good ("cake") needs to be divided between n players, each with a possibly different valuation function over pieces of the cake. For this setting, we address the problem of finding divisions…

An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree…

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

Loebl, Komlos, and Sos conjectured that if at least half of the vertices of a graph G have degree at least some natural number k, then every tree with at most k edges is a subgraph of G. Our main result is an approximate version of this…

Analogical proportions are expressions of the form ``$a$ is to $b$ what $c$ is to $d$'' at the core of analogical reasoning which itself is at the core of human and artificial intelligence. The author has recently introduced {\em from first…

A neat question involving coin flips surfaced on $\Bbb X$, and generated an intensive `storm' of `social mathematics'. In a sequence of flips of a fair coin, Alice wins a point at each appearance of two consecutive heads, and Bob wins a…

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let…

We derive new tight bipartite Bell inequalities for various scenarios. A bipartite Bell scenario $(X,Y,A,B)$ is defined by the numbers of settings and outcomes per party, $X$, $A$ and $Y$, $B$ for Alice and Bob, respectively. We derive the…

We prove a lower bound to quantum Max Cut of a graph in terms of the Lov\'asz theta function of its complement. For a graph with $m$ edges, $\text{qmc}(G) \geq \tfrac{m}{4}\big( 1 + \tfrac{8}{3\pi}\tfrac{1}{\vartheta(\bar{G}) -1} \big)$,…

A slice (G, S) of finite groups is a pair consisting of a finite group G and a subgroup S of G. In this paper, we show that some properties of finite groups extend to slices of finite groups. In particular, by analogy with B-groups, we…

For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $\alpha \geq a$ and…

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

Alon and Krivelevich proved that for every $n$-vertex subcubic graph $H$ and every integer $q \ge 2$ there exists a (smallest) integer $f=f(H,q)$ such that every $K_f$-minor contains a subdivision of $H$ in which the length of every…

In this paper, new upper and lower bounds for the Trapezoid inequality of absolutely continuous functions are obtained. Applications to some special means are provided as well.

Let $G$ be a semisimple linear algebraic group over a field $k$ and let $G^+(k)$ be the subgroup generated by the subgroups $R_u(Q)(k)$, where $Q$ ranges over all the minimal $k$-parabolic subgroups $Q$ of $G$. We prove that if $G^+(k)$ is…