Related papers: Nil Bohr$_0$-sets, Poincar\'e recurrence and gener…

Let $f$ be a generically finite polynomial map $f: \mathbb{C}^n\to \mathbb{C}^m$ of algebraic degree $d$. Motivated by the study of the Jacobian Conjecture, we prove that the set $S_f$ of non-properness of $f$ is covered by parametric…

We derive bulk asymptotics of skew-orthogonal polynomials (sop) $\pi^{\bt}_{m}$, $\beta=1$, 4, defined w.r.t. the weight $\exp(-2NV(x))$, $V (x)=gx^4/4+tx^2/2$, $g>0$ and $t<0$. We assume that as $m,N \to\infty$ there exists an $\epsilon >…

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Given $H\subseteq \mathbb{C}$ two natural objects to study are the set of zeros of polynomials with coefficients in $H$, $$\{z\in \mathbb{C}: \exists k>0,\, \exists (a_n)\in H^{k+1}, \sum_{n=0}^{k}a_{n}z^n=0\},$$ and the set of zeros of…

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…

Two decades ago P. Martin and D. Woodcock made a surprising and prophetic link between statistical mechanics and representation theory. They observed that the decomposition numbers of the blob algebra (that appeared in the context of…

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

Let $A\subseteq\{1,...,N\}$ and $P_1,...,P_\ell\in\Z[n]$ with $P_i(0)=0$ and $\deg P_i=k$ for every $1\leq i\leq\ell$. We show, using Fourier analytic techniques, that for every $\VE>0$, there necessarily exists $n\in\N$ such that…

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

The classical Noether Normalization Lemma states that if $S$ is a finitely generated algebra over a field $k$, then there exist elements $x_1,\dots,x_n$ which are algebraically independent over $k$ such that $S$ is a finite module over…

The Poincar\'e polynomial of a Weyl group calculates the Betti numbers of the projective homogeneous space $G/B$, while the $h$-vector of a simple polytope calculates the Betti numbers of the corresponding rationally smooth toric variety.…

Let $G$ be a Polish group and let $H \leq G$ be a compact subgroup. We prove that there exists a Borel set $T \subset G$ which is simultaneously a complete set of coset representatives of left and right cosets, provided that a certain index…

We study recurrence and non-recurrence sets for dynamical systems on compact spaces, in particular for products of rotations on the unit circle T. A set of integers is called r-Bohr if it is recurrent for all products of r rotations on T,…

The field identification problem, including fixed point resolution, is solved for the non-hermitian symmetric $N=2$ superconformal coset theories. Thereby these models are finally identified as well-defined modular invariant CFTs. As an…

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

In this paper, we unify the theory of SSD spaces and the theory of strongly representable sets, and we apply our results to the theory of the various classes of maximally monotone sets. In particular, we prove that type (ED), dense type,…

The results of Bergelson-Host-Kra and Leibman say that a multiple polynomial correlation sequence can be decomposed into a sum of a nilsequence (a sequence defined by evaluating a continuous function along an orbit in a nilsystem) and a…

We compare four key hierarchies for solving Constrained Polynomial Optimization Problems (CPOP): Sum of Squares (SOS), Sum of Diagonally Dominant Polynomials (SDSOS), Sum of Nonnegative Circuits (SONC), and the Sherali Adams (SA)…

We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…

Given a subspace arrangement, there are several De Concini-Procesi models associated to it, depending on distinct sets of initial combinatorial data (building sets). The first goal of this paper is to describe, for the root arrangements of…