Related papers: Logical limit laws for layered permutations and re…

We consider a class of linear ODEs of second order with variable coefficients and construct its Lie algebra of Lie group of equivalence transformations. Further we find invariants and differential invariants of this Lie algebra and by using…

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…

The allowed patterns of a map on a one-dimensional interval are those permutations that are realized by the relative order of the elements in its orbits. The set of allowed patterns is completely determined by the minimal patterns that are…

We study the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modeled by data words, and specifications are given as…

This work introduces a canonical structure for a broad class of unconstrained first-order algorithms that admit a Lur'e representation, including systems with relative degree greater than one, e.g., systems with delayed gradient feedback.…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

We give examples of families of Frobenius type structures on the punctured plane and we study their limits at the boundary. We then discuss the existence of a limit Frobenius manifold. We also give an example of a logarithmic Frobenius…

We determine all 2- and 3-cocycles for Laver tables, an infinite sequence of finite structures obeying the left-selfdistributivity law; in particular, we describe simple explicit bases. This provides a number of new positive braid…

We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…

We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraisse limit. Some examples such as the class of all…

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…

We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…