Related papers: Controlling iterated jumps of solutions to combina…
We consider Milnor's "tower algorithm" in the space of piecewise monotone maps, an iterative algorithm on the space of metrics which unifies, on the one hand, Thurston's iterative scheme which converges to holomorphic models, and, on the…
Often regarded as the study of how order emerges from randomness, Ramsey theory has played an important role in mathematics and computer science, giving rise to applications in numerous domains such as logic, parallel processing, and number…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
We consider the links between Ramsey theory in the integers, based on van der Waerden's theorem, and (boolean, CNF) SAT solving. We aim at using the problems from exact Ramsey theory, concerned with computing Ramsey-type numbers, as a rich…
We prove additive and multiplicative partition theorems, obtaining combinatorial results for p-quasicyclic groups, where p is a prime number. We also get density results for p-quasicyclic groups via left F{\o}lner sequences of non-empty…
Suppose you have an uncomputable set $X$ and you want to find a set $A$, all of whose infinite subsets compute $X$. There are several ways to do this, but all of them seem to produce a set $A$ which is fairly sparse. We show that this is…
Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…
It is considered to re-formulate quantum theory as it appears: A theory of continuous and causal time evolution, interrupted by discontinuous and stochastic jumps. To develop the (missing) theory of jumps a heuristic-phenomenological…
We construct the classical Poisson structure and $r$-matrix for some finite dimensional integrable Hamiltonian systems obtained by constraining the flows of soliton equations in a certain way. This approach allows one to produce new kinds…
In this paper, we shed new light on the Flexible Atom Conjecture. We first give finite representation results for relation algebras $33_{37}, 35_{37}$, $77_{83}$, $78_{83}$, $80_{83}$, $82_{83}$, $83_{83}$, $1310_{1316}$, $1313_{1316}$,…
Evaluating conjunctive queries and solving constraint satisfaction problems are fundamental problems in database theory and artificial intelligence, respectively. These problems are NP-hard, so that several research efforts have been made…
The analysis of dynamical systems is a fundamental tool in the natural sciences and engineering. It is used to understand the evolution of systems as large as entire galaxies and as small as individual molecules. With predefined conditions…
We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a…
We consider the dynamics of a 1D system evolving according to a deterministic drift and randomly forced by two types of jumps processes, one representing an external, uncontrolled forcing and the other one a control that instantaneously…
We develop infinite-dimensional Ramsey theory for Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages. We show that our approach is optimal and in particular, recovers the exact big Ramsey degrees…
Hypothesis testing is a key part of empirical science and multiple testing as well as the combination of evidence from several tests are continued areas of research. In this article we consider the problem of combining the results of…
The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…
The thin set theorem for $n$-tuples and $k$ colors ($\mathsf{TS}^n_k$) states that every $k$-coloring of $[\mathbb{N}]^n$ admits an infinite set of integers $H$ such that $[H]^n$ avoids at least one color. In this paper, we study the…