English
Related papers

Related papers: Big Ramsey degrees and forbidden cycles

200 papers

We construct Hamiltonians for systems of nonrelativistic particles linearly coupled to massive scalar bosons using abstract boundary conditions. The construction yields an explicit characterisation of the domain of self-adjointness in terms…

Mathematical Physics · Physics 2019-03-27 Jonas Lampart , Julian Schmidt

We establish some results about large restricted Lie algebras similar to those known in the Group Theory. As an application we use this group-theoretic approach to produce some examples of restricted as well as ordinary Lie algebras which…

Rings and Algebras · Mathematics 2007-05-23 Yuri Bahturin , Alexander Olshanskii

In this paper, we consider combining the ideas of forbidden random context grammars as well as of ordered grammars with cooperating distributed grammar systems (CDGS). We focus on investigating their generative capacities. Both ideas can be…

Formal Languages and Automata Theory · Computer Science 2026-04-23 Henning Fernau , Lakshmanan Kuppusamy , Jana Schulz

We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…

Computational Complexity · Computer Science 2017-08-10 Ruhollah Majdoddin

We study Ramsey-theoretic properties of several natural classes of finite ultrametric spaces, describe the corresponding Urysohn spaces and compute a dynamical invariant attached to their isometry groups.

Combinatorics · Mathematics 2014-01-07 L. Nguyen Van Thé

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We investigate in the paper general (not necessarily definite) canonical systems of differential equation in the framework of extension theory of symmetric linear relations. For this aim we first introduce the new notion of a boundary…

Functional Analysis · Mathematics 2011-09-14 Vadim Mogilevskii

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…

Logic in Computer Science · Computer Science 2021-11-15 Paul Krogmeier , P. Madhusudan

We show that the infinite-dimensional versions of Gowers' $\mathrm{FIN}_k$ and $\mathrm{FIN}_{\pm k}$ theorems can be parametrized by an infinite sequence of perfect subsets of $2^\omega$. To do so, we use ultra-Ramsey theory to obtain…

Combinatorics · Mathematics 2020-06-19 Jamal K. Kawach

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

Combinatorics · Mathematics 2020-06-15 Lázaro Alberto Larrauri

We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…

Operator Algebras · Mathematics 2017-11-28 Matthew Kennedy , Taras Kolomatski , Daniel Spivak

In this work we study the classes of epsilon and nearly epsilon-strongly graded rings by a group $G$. In particular, we extend Dade's theorem to the realm of nearly epsilon-strongly graded rings. Moreover, we introduce the category…

Rings and Algebras · Mathematics 2020-10-14 Luis Martínez , Héctor Pinedo , Yerly Soler

We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general $r$-uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one…

Combinatorics · Mathematics 2017-09-25 Vindya Bhat , Jaroslav Nešetřil , Christian Reiher , Vojtěch Rödl

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…

Computational Complexity · Computer Science 2007-05-23 Ming Li , Paul Vitanyi

The paper studies the higher-order absolute differences taken from progressive terms of time-homogenous binary Markov chains. Two theorems presented are the limiting theorems for these differences, when their order $k$ converges to…

Probability · Mathematics 2017-06-27 A. Yu. Shahverdian

We introduce a new boundary condition which renders the flux-insertion argument for the Lieb-Schultz-Mattis type theorems in two or higher dimensions free from the specific choice of system sizes. It also enables a formulation of the…

Strongly Correlated Electrons · Physics 2020-07-15 Yuan Yao , Masaki Oshikawa

In this note we establish a Ramsey-type result for certain subsets of the $n$-dimensional cube. This can then be applied to obtain reasonable bounds on various related structures, such as (partial) Hales-Jewett lines for alphabets of sized…

Combinatorics · Mathematics 2008-07-11 Ron Graham , Jozsef Solymosi

Reconsidering the variational procedure for uniaxial systems modeled by continuous free energy functionals, we derive new general conditions for thermodynamic extrema. The utility of these conditions is briefly illustrated on the models for…

Statistical Mechanics · Physics 2009-10-30 V. Dananic , A. Bjelis

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

Combinatorics · Mathematics 2020-09-23 Jakub Byszewski , Jakub Konieczny , Elżbieta Krawczyk