English
Related papers

Related papers: Solving Equation Systems in $\omega$-categorical A…

200 papers

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…

Group Theory · Mathematics 2007-05-23 Kevin Wortman

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

Optimization and Control · Mathematics 2024-12-30 Lei Huang

We answer an implicit question of Ian Hodkinson's. We show that atomic Pinters algebras may not be completely representable, however the class of completely representable Pinters algebras is elementary and finitely axiomatizable. We obtain…

K-Theory and Homology · Mathematics 2013-04-03 Tarek Sayed Ahmed

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

Logic · Mathematics 2015-03-17 Murray Neuzerling

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Logic · Mathematics 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

We study the Fourier--Stieltjes algebra of Roelcke precompact, non-archimedean, Polish groups and give a model-theoretic description of the Hilbert compactification of these groups. We characterize the family of such groups whose…

Logic · Mathematics 2017-10-23 Itaï Ben Yaacov , Tomás Ibarlucía , Todor Tsankov

For an arbitrary finite dimensional algebra $\Lambda$, we prove that any wide subcategory of $\mathsf{mod} \Lambda$ satisfying a certain finiteness condition is $\theta$-semistable for some stability condition $\theta$. More generally, we…

Representation Theory · Mathematics 2023-04-21 Toshiya Yurikusa

The problem of classifying all short multiplets of superconformal algebras still seems to be an open question. A generic short multiplet is non-unitary, which nevertheless is of interest in various contexts. Even if one is interested in…

High Energy Physics - Theory · Physics 2019-12-02 Masahito Yamazaki

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc

We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…

Rings and Algebras · Mathematics 2013-10-02 Paolo Faccin , Willem A. de Graaf

In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…

Representation Theory · Mathematics 2018-06-07 Sota Asai

We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…

Formal Languages and Automata Theory · Computer Science 2024-11-15 Jorge Almeida , Manfred Kufleitner , Jan Philipp Wächter

We study an explicit description of semibricks and 2-term simple-minded collections over preprojective algebras of type $A$ via arc diagrams. We provide a bijection between the set of noncrossoing arc diagrams (resp. the set of double arc…

Representation Theory · Mathematics 2022-04-01 Yuya Mizuno

Working jointly in the equivalent categories of MV-al\-ge\-bras and lattice-ordered abelian groups with strong order unit (for short, unital $\ell$-groups), we prove that isomorphism is a sufficient condition for a separating subalgebra $A$…

Logic · Mathematics 2013-12-31 L. M. Cabrer , D. Mundici

We give a classification of semisimple and separable algebras in a multi-fusion category over an arbitrary field in analogy to Wedderben-Artin theorem in classical algebras. It turns out that, if the multi-fusion category admits a…

Quantum Algebra · Mathematics 2019-11-22 Liang Kong , Hao Zheng

A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…

Combinatorics · Mathematics 2007-05-23 A. Regev

A classification of the semisimple subalgebras of the Lie algebra of traceless $3\times 3$ matrices with complex entries, denoted $A_2$, is well-known. We classify its nonsemisimple subalgebras, thus completing the classification of the…

Rings and Algebras · Mathematics 2024-08-20 Andrew Douglas , Joe Repka

We study {\em disemisimple} Lie algebras, i.e., Lie algebras which can be written as a vector space sum of two semisimple subalgebras. We show that a Lie algebra $\mathfrak{g}$ is disemisimple if and only if its solvable radical coincides…

Representation Theory · Mathematics 2022-01-24 Dietrich Burde , Wolfgang Alexander Moens

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo
‹ Prev 1 3 4 5 6 7 10 Next ›