English
Related papers

Related papers: On the consistency problem for modular lattices an…

200 papers

We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…

Logic · Mathematics 2024-10-08 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…

Systems and Control · Computer Science 2014-02-12 Nikos Vlassis , Raphaël Jungers

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

Computational Complexity · Computer Science 2017-10-24 Paweł M. Idziak , Jacek Krzaczkowski

In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…

Combinatorics · Mathematics 2018-11-07 A. Saki , D. Kiani

We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…

General Mathematics · Mathematics 2007-05-23 Pavel Ruzicka , Jiri Tuma , Friedrich Wehrung

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

Logic in Computer Science · Computer Science 2014-01-17 Vincent Aravantinos , Ricardo Caferra , Nicolas Peltier

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

Logic · Mathematics 2013-11-13 Ralph McKenzie , Matthew Smedberg

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

Computational Complexity · Computer Science 2023-10-18 Matthias C. Caro

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

Number Theory · Mathematics 2022-11-22 Nicolas Allen Smoot

We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving…

Combinatorics · Mathematics 2023-09-15 Dinh Van Le , Tim Römer

In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…

Data Structures and Algorithms · Computer Science 2024-11-26 Frederik Glitzner , David Manlove

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

Algebraic Geometry · Mathematics 2008-07-29 Tim Netzer

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

Representation Theory · Mathematics 2020-12-09 Olivier Brunat , Jean-Baptiste Gramain , Nicolas Jacon

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They…

Logic in Computer Science · Computer Science 2017-03-10 Luigi Santocanale

We explore the integration of representations from a Lie algebra to its algebraic group in positive characteristic. An integrable module is stable under the twists by group elements. Our aim is to investigate cohomological obstructions for…

Representation Theory · Mathematics 2019-10-30 Dmitriy Rumynin , Matthew Westaway

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…

Number Theory · Mathematics 2026-01-15 J. E. Cremona , P. Koymans

In this paper we introduce and study the lattice of normal subgroups of a group $G$ that determine solitary quotients. It is closely connected to the well-known lattice of solitary subgroups of $G$ (see \cite{5}). A precise description of…

Group Theory · Mathematics 2018-06-01 Marius Tărnăuceanu

We study algebraicity and smoothness of fixed point stacks for flat group schemes which have a finite composition series whose factors are either reductive or proper, flat, finitely presented, acting on algebraic stacks with affine,…

Algebraic Geometry · Mathematics 2022-09-19 Matthieu Romagny

We present a systematic study of symmetries, invariants and moduli spaces of classes of coframes. We introduce a classifying Lie algebroid to give a complete description of the solution to Cartan's realization problem that applies to both…

Differential Geometry · Mathematics 2012-10-08 Rui Loja Fernandes , Ivan Struchiner