Related papers: A zero-one SUBEXP-dimension law for BPP

We consider random character values X(g) of the symmetric group on n symbols, where X is chosen at random from the set of irreducible characters and g is chosen at random from the group, and we show that X(g)=0 with probability tending to…

We study the directional entropy of the dynamical system associated to a $\Z^2$ configuration in a finite alphabet. We show that under local assumptions on the complexity, either every direction has zero topological entropy or some…

We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.

A space X has the local fixed point property LFPP, (local periodic point property LPPP) if it has an open basis $\mathcal{B}$ such that, for each $B\in \mathcal{B}$, the closure $\overline{B}$ has the fixed (periodic) point property. Weaker…

We give simple deterministic reductions demonstrating the NP-hardness of approximating the nearest codeword problem and minimum distance problem within arbitrary constant factors (and almost-polynomial factors assuming NP cannot be solved…

Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on $[0,1)$ which is invariant under both $x\mapsto…

The infinite discrete stable Boltzmann maps are generalisations of the well-known Uniform Infinite Planar Quadrangulation in the case where large degree faces are allowed. We show that the simple random walk on these random lattices is…

We prove an explicit formula for the dependence of the exponent in the fractal uncertainty principle of Bourgain-Dyatlov on the dimension and on the regularity constant for the regular set. In particular, this implies an explicit essential…

In a previous paper ("A characterization of topologically completely positive entropy for shifts of finite type"), the author gave a characterization for when a $\mathbb{Z}^d$-shift of finite type (SFT) has no nontrivial subshift factors…

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…

Non-closedness of subexponentiality by the convolution operation is well-known. We go a step further and show that subexponentiality and non-subexponentiality are generally changeable by the convolution. We also give several conditions, by…

We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary…

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…

Here I discuss ideas that makes a synthesis of topology and probability theory. The idea is the following: given a set $X$, assign a number $p(A)\in [0,1]$ for any subset $A$ of $X$. We can interpret $p(A)$ as the probability of openness of…

The entanglement entropy of a gapless fermion subsystem coupled to a gapless bulk by a "weak link" is considered. It is demonstrated numerically that each independent weak link contributes an entropy proportional to lnL, where L is linear…

We develop a polynomial method on finite fields to amplify the hardness of spare sets in nondeterministic time complexity classes on a randomized streaming model. One of our results shows that if there exists a $2^{n^{o(1)}}$-sparse set in…

We prove that any two general probabilistic theories (GPTs) are entangleable, in the sense that their composite exhibits either entangled states or entangled measurements, if and only if they are both non-classical, meaning that neither of…

This paper investigates instances of Sobolev embeddings characterized by local compactness at every point within their domain, except for a single point. We obtain the sharp conditions that distinguish compactness from non-compactness and…

The notion of metric entropy dimension is introduced to measure the complexity of entropy zero dynamical systems. For measure preserving systems, we define entropy dimension via the dimension of entropy generating sequences. This…

We demonstrate that a system of self-propelled particles (SPP) exhibits spontaneous symmetry breaking and self-organization in one dimension, in contrast with previous analytical predictions. To explain this surprising result we derive a…