Related papers: Sharing a measure of maximal entropy in polynomial…
Given a partition $\{I_1,\ldots,I_k\}$ of $\{1,\ldots,n\}$, let $(X_1,\ldots,X_n)$ be random vector with each $X_i$ taking values in an arbitrary measurable space $(S,\mathscr{S})$ such that their joint law is invariant under finite…
We develop a new method suitable for establishing lower bounds on the ball measure of noncompactness of operators acting between considerably general quasinormed function spaces. This new method removes some of the restrictions…
For any diagonal element $a$ with two eigenvalues, we construct a sequence of $a$-invariant probability measures on the space of unimodular lattices with high entropy but converging to the zero measure. This extends the result of Kadyrov…
It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…
We present a semi-algorithm which for any irreducible $p\in\mathbb{K}[x,y]$ finds all elements of $\mathbb{K}(x) + \mathbb{K}(y)$ that are of the form $qp$ for some $q\in\mathbb{K}(x,y)$ whose denominator is not divisible by $p$.
We discuss when two rational functions $f$ and $g$ can have the same measure of maximal entropy. The polynomial case was completed by (Beardon, Levin, Baker-Eremenko,Schmidt-Steinmetz, etc., 1980s-90s), and we address the rational case…
Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…
Let $V$ be a projective variety defined over a number field $K$, let $S$ be a polarized set of endomorphisms of $V$ all defined over $K$, and let $P\in V(K)$. For each prime $\mathfrak{p}$ of $K$, let $m_{\mathfrak{p}}(S,P)$ denote the…
Let R=k[x_1,...,x_n] be a polynomial ring over a field k. Let J={j_1,...,j_t} be a subset of [n]={1,...,n}, and let m_J denote the ideal (x_{j_1},...,x_{j_t}) of R. Given subsets J_1,...,J_s of [n] and positive integers a_1,...,a_s, we…
We give a simple development of the concentration properties of compound Poisson measures on the nonnegative integers. A new modification of the Herbst argument is applied to an appropriate modified logarithmic-Sobolev inequality to derive…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
We propose a nonparametric estimator of multivariate joint entropy based on partitioned sample spacing (PSS). The method extends univariate spacing ideas to $\mathbb{R}^{d}$ by partitioning into localized cells and aggregating within-cell…
We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…
In this paper, we investigate several types of low complexity of finite partitions, including precompactness, zero maximal pattern entropy, bounded mean complexity and mean equicontinuity. We first show that a collection of finite…
Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…
We develop a new technique for studying monomial ideals in the standard polynomial rings $A[X_1,\ldots,X_d]$ where $A$ is a commutative ring with identity. The main idea is to consider induced ideals in the semigroup ring…
Although compartmental dynamical systems are used in many different areas of science, model selection based on the maximum entropy principle (MaxEnt) is challenging because of the lack of methods for quantifying the entropy for this type of…
We show that if $h\in \mathbb{Z}[x]$ is a polynomial of degree $k \geq 2$ such that $h(\mathbb{N})$ contains a multiple of $q$ for every $q\in \mathbb{N}$, known as an $\textit{intersective polynomial}$, then any subset of $\{1,2,\dots,N\}$…
Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…