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

We study the sequence entropy of rank one measure-preserving systems along subexponential sequences. We prove that the sequence entropy along a large class of sequences can be infinite using Ornstein's probabilistic constructions. Moreover,…

A point $z$ in the Julia set of a polynomial $p$ is called biaccessible if two dynamic rays land at $z$; a point $z$ in the Mandelbrot set is called biaccessible if two parameter rays land at $z$. In both cases, we say that the external…

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question…

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

This paper is concerned with the inhomogeneous incompressible Euler system. We establish a Duchon--Robert type approximation theorem for the distribution describing the local energy flux of bounded solutions. The velocity field is assumed…

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…

In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Let $\tau \in (0,\infty), \delta \in (0,1), \epsilon \in (0,1)$ be arbitrary constants. Assume…

We prove that the Minimum Distance Problem (MDP) on linear codes over any fixed finite field and parameterized by the input distance bound is W[1]-hard to approximate within any constant factor. We also prove analogous results for the…

Let $A$ be an infinite-dimensional unital simple C*-algebra such that A has $\mu$-$oz{\rm LLP}$ property for any $\mu\in(0,1)$. Let $B\subseteq A$ be a centrally large subalgebra of $A$ such that $B$ has tracial topological rank zero. Then…

Let A be a tame quasi-tilted algebra and d the dimension vector of an indecomposable A-module. In the paper we prove that each irreducible component of the variety of A-modules of dimension vector d is regular in codimension one.

We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at…

On the space of unimodular lattices, we construct a sequence of invariant probability measures under a singular diagonal element with high entropy and show that the limit measure is 0.

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…

We study the topological complexities of relative entropy zero extensions acted by countableinfinite amenable groups. Firstly, for a given Folner sequence $\{F_n\}_{n=0}^\infty$, we define respectively the relative entropy dimensions and…

We compute the bi-free max-convolution which is the operation on bi-variate distribution functions corresponding to the max-operation with respect to the spectral order on bi-free bi-partite two-faced pairs of hermitian non-commutative…

Given an irreducible variety $X$ over a finite field, the density of hypersurfaces of varying degree $d$ intersecting $X$ in an irreducible subvariety is $1$, by a result of Charles and Poonen. In this note, we analyse the situation fixing…

This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…

This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not.…

We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…

We study the setting in which the bits of an unknown infinite binary sequence x are revealed sequentially to an observer. We show that very limited assumptions about x allow one to make successful predictions about unseen bits of x. First,…