Related papers: Refining the Two-Dimensional Signed Small Ball Ine…

Let $S_n=\e_1+...+\e_n$, where $ \e_i $ are i.i.d. Bernoulli r.v.'s. Let $0\le r_d(n)<2d$ be the least residue of $n$ mod$(2d)$, $\bar r_d(n)= 2d -r_d(n)$ and $\b(n,d)=\max ({1\over d}, {1\over \sqrt n})[e^{- {r_d(n)^2/2 n}} +e^{- {\bar…

A signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges which corresponds to an assignment of signs to the edges: edges in $\Sigma$ are negative while edges not in $\Sigma$ are positive. A closed walk of a signed…

We study real bihomogeneous polynomials $r(z,\bar{z})$ in $n$ complex variables for which $r(z,\bar{z}) \|z\|^2$ is the squared norm of a holomorphic polynomial mapping. Such polynomials are the focus of the Sum of Squares Conjecture, which…

The purpose of this note is to prove estimates for $$ \left| \sum_{k=1}^{n} \mbox{sign} \left( \cos \left( \frac{2\pi a}{n} k \right) \right) \mbox{sign} \left( \cos \left( \frac{2\pi b}{n} k \right) \right)\right|,$$ when $n$ is prime and…

A matrix $A\in \mathbb{R}^{m \times n}$ is strictly sign regular/SSR (or sign regular/SR) if for each $1 \leq k \leq \min\{m,n\}$, all (non-zero) $k\times k$ minors of $A$ have the same sign. This class of matrices contains the totally…

In the spirit of the Genetics of the Regular Figures, by L. Fejes T\'oth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as…

Let $(E, \lVert . \rVert)$ be a two-dimensional real normed space with unit sphere $S = \{x \in E, \lVert x \rVert = 1\}$. The main result of this paper is the following: Consider an affine regular hexagon with vertex set $H = \{\pm v_1,…

This paper is devoted to the problem of minimizing a sum of rational functions over a basic semialgebraic set. We provide a hierarchy of sum of squares (SOS) relaxations that is dual to the generalized moment problem approach due to…

Combining the results of a recent paper by Fleckinger-Hernandez-deTh{\'e}lin [14] for a non cooperative $2\times2$ system with the method of PhD Thesis of MH Lecureux we compute the sign of the solutions of a $n\times n$ non-cooperative…

A signed graph $\Sigma = (G, \sigma)$ is a graph where the function $\sigma$ assigns either $1$ or $-1$ to each edge of the simple graph $G$. The adjacency matrix of $\Sigma$, denoted by $A(\Sigma)$, is defined canonically. In a recent…

The main result of this paper is that for any norm on a complex or real $n$-dimensional linear space, every extremal basis satisfies inverted triangle inequality with scaling factor $2^n-1$. Furthermore, the constant $2^n-1$ is tight. We…

The Kahane--Salem--Zygmund inequality for multilinear forms in $\ell_{\infty}$ spaces claims that, for all positive integers $m,n_{1},...,n_{m}$, there exists an $m$-linear form $A\colon\ell_{\infty}^{n_{1}}\times\cdots\times…

For an integer b>=2, let s_b(n) be the sum of the digits of the integer n when written in base b, and let S_b(N) be the sum of s_b(n) over n=0,...,N-1, so that S_b(N) is the sum of all b-ary digits needed to write the numbers 0,1,...,N-1.…

The Hardy-Rellich inequality in the whole space with the best constant was firstly proved by Tertikas and Zographopoulos in Adv. Math. (2007) in higher dimensions $N\geq 5$. Then it was extended to lower dimensions $N\in \{3, 4\}$ by…

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

Using the notion of higher-order Fourier dimension introduced in \cite{M2} (which was a sort of psuedorandomness condition stemming from the Gowers norms of Additive Combinatorics), we prove a maximal theorem and corresponding…

We show that for two doubling measures $\sigma$ and $\omega$ on $\mathbb{R}^{n}$ and any fixed dyadic grid $\mathcal{D}$ in $\mathbb{R}^{n}$, \[ \mathfrak{N}_{\mathbf{R}^{\lambda, n}}\left( \sigma,\omega\right)…

A signed graph is a pair $(G,\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,...,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd and the other edges even. By…

In this paper we prove a correspondence principle between multivariate functions of bounded variation in the sense of Hardy and Krause and signed measures of finite total variation, which allows us to obtain a simple proof of a generalized…

Given positive integers k and r where 4 divides k and k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who…