Related papers: On Reals with $\Delta^{0}_{2}$-Bounded Complexity …
Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…
The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are…
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…
We establish the boundedness of weak subsolutions for a class of degenerate Kolmogorov equations of hypoelliptic type, compatible with a homogeneous Lie group structure, within bounded product domains using the De Giorgi iteration. We…
Let $G$ be a connected and simply connected semisimple algebraic group over $\Bbb Q$ and let $\Gamma\subset G(\Bbb Q)$ be an arithmetic subgroup. Let $K_\infty\subset G(\Bbb R)$ be a maximal compact subgroup and let $d$ be the dimension of…
We prove the following results for a unital simple direct limit $A$ of recursive subhomogeneous algebras with no dimension growth: (1) A has stable rank 1. (2) The projections in $M_{\infty} (A)$ satisfy cancellation: if $e \oplus q \sim f…
The goal of this paper is to study when uniform Roe algebras have certain $C^*$-algebraic properties in terms of the underlying space: in particular, we study properties like having stable rank one or real rank zero that are thought of as…
There are a dozen definitions of weak higher categories, all of which loosen the notion of composition of arrows. A new approach is presented here, where instead the notion of identity arrow is weakened -- these are tentatively called fair…
The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…
We define the weak-normalization and the seminormalization of a real algebraic variety relative to its central locus. The study is related to the properties of the rings of continuous rational functions and hereditarily rational functions…
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…
A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure $\nu$ on the Cantor space $\C$ and any suitable complexity class $C \subseteq \C$, the theory identifies the subsets…
A $c$-short program for a string $x$ is a description of $x$ of length at most $C(x) + c$, where $C(x)$ is the Kolmogorov complexity of $x$. We show that there exists a randomized algorithm that constructs a list of $n$ elements that…
Bennett's notion of depth is usually considered to describe the usefulness and internal organization of the information encoded into an object such as an infinite binary sequence. We consider a natural way to relativize the notion of depth…
We clarify the notion of the DS --- generalized Drinfeld-Sokolov --- reduction approach to classical ${\cal W}$-algebras. We first strengthen an earlier theorem which showed that an $sl(2)$ embedding ${\cal S}\subset {\cal G}$ can be…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
Solomonoff's general theory of inference and the Minimum Description Length principle formalize Occam's razor, and hold that a good model of data is a model that is good at losslessly compressing the data, including the cost of describing…
Weak structures abound in higher category theory, but are often suitably equivalent to stricter structures that are easier to understand. We extend strictification for tricategories and trihomomorphisms to trinatural transformations,…