Related papers: Characterizing Polynomial Ramsey Quantifiers
A central question in computer science and statistics is whether efficient algorithms can achieve the information-theoretic limits of statistical problems. Many computational-statistical tradeoffs have been shown under average-case…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…
Positively graded algebras are fairly natural objects which are arduous to be studied. In this article we query quotients of non-standard graded polynomial rings with combinatorial and commutative algebra methods.
We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. Of particular importance are fluctuations with the correlation time that exceeds the decoherence time due to decay and…
Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…
In (quant-ph/0701141) Rajeev studied quantization of the damped simple harmonic oscillator and introduced a complex-valued Hamiltonian (which is normal). In this note we point out that the quantization is interpreted as a quantum mechanics…
We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…
We define some natural notions of strong and weak Borel Ramsey properties for countable Borel equivalence relations and show that they hold for a countable Borel equivalence relation if and only if the equivalence relation is smooth. We…
We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…
Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them,…
Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real…
We say that a graph with $n$ vertices is $c$-Ramsey if it does not contain either a clique or an independent set of size $c \log n$. We define a CNF formula which expresses this property for a graph $G$. We show a superpolynomial lower…