Related papers: Characterising SJT reducibility

We introduce joint exclusivity (JE), a form of extremal negative dependence that extends the classical notion of mutual exclusivity. The JE structure is analytically tractable and is defined by the exclusion of the interior of the…

The minimal set of Shannon-type inequalities (referred to as elemental inequalities), plays a central role in determining whether a given inequality is Shannon-type. Often, there arises a situation where one needs to check whether a given…

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…

We prove that n-variable logics do not have the weak Beth definability property, for all n greater than 2. This was known for n=3 (Ildik\'o Sain and Andr\'as Simon), and for n greater than 4 (Ian Hodkinson). Neither of the previous proofs…

The set disjointness problem is one of the most fundamental and well-studied problems in communication complexity. In this problem Alice and Bob hold sets $S, T \subseteq [n]$, respectively, and the goal is to decide if $S \cap T =…

For each $n \geq 1$, let $\{X_{j,n}\}_{1 \leq j \leq n}$ be a sequence of strictly stationary random variables. In this article, we give some asymptotic weak dependence conditions for the convergence in distribution of the point process…

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…

Given an n-tuple {a_1, ..., a_n} of self-adjoint operators on an infinite dimensional Hilbert space H and a positive integer k, there exists a projection p of rank k such that, for each for j = 1, ..., n, pa_jp is a scalar multiple of p.…

Let $(X, T)$ be a topological dynamical system. Denote by $h (T, K)$ and $h^B (T, K)$ the covering entropy and dimensional entropy of $K\subseteq X$, respectively. $(X, T)$ is called D-{\it lowerable} (resp. {\it lowerable}) if for each…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

We study generalizations of Demuth's Theorem, which states that the image of a Martin-L\"of random real under a tt-reduction is either computable or Turing equivalent to a Martin-L\"of random real. We show that Demuth's Theorem holds for…

Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this…

An operator T on Hilbert space is a 3-isometry if there exists operators B and D such that (T*)^n T^n = I+nB +n^2 D. An operator J is a Jordan operator if it the sum of a unitary U and nilpotent N of order two which commute. If T is a…

Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although this problem is NP-hard in general, real-world instances are…

This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering.…

The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…

Let $H_1,H_2$ be complex Hilbert spaces and $T$ be a densely defined closed linear operator (not necessarily bounded). It is proved that for each $\epsilon>0$, there exists a bounded operator $S$ with $\|S\|\leq \epsilon$ such that $T+S$ is…