Related papers: Complexity in Young's Lattice

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some real-time…

The quantum field theory describing the massive O(2) nonlinear sigma-model is investigated through two non-perturbative constructions: The form factor bootstrap based on integrability and the lattice formulation as the XY model. The…

We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of…

We discuss a conjecture of Donaldson on a version of Yau's Theorem for symplectic forms with compatible almost complex structures and survey some recent progress on this problem. We also speculate on some future possible directions, and use…

We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

A notion of interpretation between arbitrary logics is introduced, and the poset Log of all logics ordered under interpretability is studied. It is shown that in Log infima of arbitrarily large sets exist, but binary suprema in general do…

We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…

In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…

Characteristic Lie rings for Toda type 2+1 dimensional lattices are defined. Some properties of these rings are studied. Infinite sequence of special kind modules are introduced. It is proved that for known integrable lattices these modules…

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…

Built upon the proposal of Kaplan et.al. [hep-lat/0206109], we construct noncommutative lattice gauge theory with manifest supersymmetry. We show that such theory is naturally implementable via orbifold conditions generalizing those used by…

For a large class of finite W algebras, the defining relations of a Yangian are proved to be satisfied. Therefore such finite W algebras appear as realisations of Yangians. This result is useful to determine properties of such W algebra…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We build the trigonometric solutions of the Yang-Baxter equation that can not be obtained from quantum groups in any direct way. The solution is obtained using the construction suggested recently from the rational conformal field theory…

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…