English
Related papers

Related papers: Axiomatisability problems for S-posets

200 papers

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

Group Theory · Mathematics 2021-01-19 João Araújo , Michael Kinyon , Janusz Konieczny , António Malheiro

To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…

Symplectic Geometry · Mathematics 2010-12-24 Pavel Etingof , Travis Schedler , Ivan Losev

We consider a natural generalisation of the class of hyperbolic Kac-Moody algebras. We describe in detail the conditions under which these algebras are Lorentzian. We also construct their fundamental weights, and analyse whether they…

High Energy Physics - Theory · Physics 2008-11-26 Matthias R Gaberdiel , David I Olive , Peter C West

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

Rings and Algebras · Mathematics 2007-12-04 Mark Kambites

We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.…

Combinatorics · Mathematics 2026-05-08 Wonwoo Kang , Kyeongjun Lee , Eunsung Lim

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

Group Theory · Mathematics 2026-03-09 Sachin Ballal , Tushar Halder

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Algebraic Geometry · Mathematics 2017-05-01 Saugata Basu , Cordian Riener

In previous work, to each Hopf algebra H and each invertible right two-cocycle on H, Eli Aljadeff and the first-named author attached a subalgebra B of the free commutative Hopf algebra S generated by the coalgebra underlying H; the algebra…

Quantum Algebra · Mathematics 2012-04-12 Christian Kassel , Akira Masuoka

It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…

Logic · Mathematics 2011-04-08 Miklos Ferenczi

Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence…

Computational Complexity · Computer Science 2015-07-01 Emil Kiss , Matthew Valeriote

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

Logic · Mathematics 2015-03-05 Norman Feldman

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…

Computational Complexity · Computer Science 2020-10-05 Dmitriy Zhuk

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

Combinatorics · Mathematics 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three…

Logic in Computer Science · Computer Science 2018-05-30 Olivier Carton , Thomas Colcombet , Gabriele Puppis

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

Logic in Computer Science · Computer Science 2015-07-01 Amélie Gheerbrant , Balder ten Cate

We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…

Formal Languages and Automata Theory · Computer Science 2022-10-04 Thomas Place , Marc Zeitoun

As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…

Rings and Algebras · Mathematics 2019-11-14 Ivan Chajda , Miroslav Kolařík , Helmut Länger

Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the…

Logic · Mathematics 2018-10-30 Luck Darnière

In a \emph{separability problem}, we are given two sets $K$ and $L$ from a class $\mathcal{C}$, and we want to decide whether there exists a set $S$ from a class $\mathcal{S}$ such that $K\subseteq S$ and $S\cap L=\emptyset$. In this case,…

Formal Languages and Automata Theory · Computer Science 2025-07-02 Elias Rojas Collins , Chris Köcher , Georg Zetzsche