相关论文: Big Ramsey degrees of the generic partial order
In this note we introduce higher order polar loci as natural generalizations of the classical polar loci, replacing the role of tangent spaces by that of higher order osculating spaces. The close connection between polar loci and dual…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We consider recent work linking majorization and trumping, two partial orders that have proven useful with respect to the entanglement transformation problem in quantum information, with general Dirichlet polynomials, Mellin transforms, and…
This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…
In recent years, progress toward the classification of superintegrable systems with higher order integrals of motion has been made. In particular, a complete classification of all exotic potentials with a third or a fourth order integrals,…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
Large language models (LLMs) have accomplished remarkable reasoning performance in various domains. However, in the domain of reasoning tasks, we discover a frailty: LLMs are surprisingly brittle to the ordering of the premises, despite the…
The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…
Generalized structural equations models (GSEMs) [Peters and Halpern 2021], are, as the name suggests, a generalization of structural equations models (SEMs). They can deal with (among other things) infinitely many variables with infinite…
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…
Close connections between various notions of entropy and the apparatus of category theory have been observed already in the 1980s and more vigorously developed in the past ten years. The starting point of the paper is the recent categorical…
We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an…
We consider the degrees of the elements of a homogeneous system of parameters for the ring of invariants of a binary form, give a divisibility condition, and a complete classification for forms of degree at most 8.
Both a general and a diagonal u-invariant for forms of higher degree are defined, generalizing the u-invariant of quadratic forms. Both old and new results on these invariants are collected.
The problem of (pathwise) large deviations for conditionally continuous Gaussian processes is investigated. The theory of large deviations for Gaussian processes is extended to the wider class of random processes -- the conditionally…
In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
We define a global rank for partial types based in a generalization of Shelah trees. We prove an equivalence with the depth of a localized version of the constructions known as dividing sequence and dividing chain. This rank characterizes…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…