English
Related papers

Related papers: Algebraic geometry over free semilattice

200 papers

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Attila Egri-Nagy , Chrystopher L. Nehaniv

A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…

Mathematical Physics · Physics 2013-04-17 David J. Foulis , Sylvia Pulmannova

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

Rings and Algebras · Mathematics 2015-06-11 Vladimir I. Chernousov , Andrei S. Rapinchuk , Igor A. Rapinchuk

We discuss the homological algebra of representation theory of finite dimensional algebras and finite groups. We present various methods for the construction and the study of equivalences of derived categories: local group theory, geometry…

Representation Theory · Mathematics 2007-05-23 Raphael Rouquier

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

Algebraic Geometry · Mathematics 2013-05-07 Pinaki Mondal , Tim Netzer

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

Group Theory · Mathematics 2022-04-27 Noah Caplinger , Nick Salter

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

Number Theory · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…

Rings and Algebras · Mathematics 2016-03-08 Kira Adaricheva

We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…

Mathematical Physics · Physics 2009-11-10 S. Lombardo , A. V. Mikhailov

In this note we settle some technical questions concerning finite rank quasi-free Hilbert modules and develop some useful machinery. In particular, we provide a method for determining when two such modules are unitarily equivalent. Along…

Functional Analysis · Mathematics 2007-05-23 Ronald G. Douglas , Gadadhar Misra

This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…

Logic in Computer Science · Computer Science 2025-02-17 Marek Dančo , Mikoláš Janota , Michael Codish , João Jorge Araújo

We investigate homological properties of perfect algebras of prime characteristic. The principle is as follows: perfect algebras resolve the singularities. For example, we show any module over the ring of absolute integral closure has…

Commutative Algebra · Mathematics 2017-11-16 Mohsen Asgharzadeh

The notion of {\it free} generalized vertex algebras is introduced. It is equivalent to the notion of {\it generalized principal subspaces} associated with lattices which are not necessarily integral. Combinatorial bases and the characters…

Quantum Algebra · Mathematics 2015-02-19 Kazuya Kawasetsu

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

Rings and Algebras · Mathematics 2023-09-18 Snehinh Sen

Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…

Combinatorics · Mathematics 2014-11-11 Erik Sjöland

We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…

Representation Theory · Mathematics 2007-05-23 Roman Bezrukavnikov

In Part I of this paper, we introduced a class of certain algebras of finite dimension over a field. All these algebras are split, symmetric and local. Here we continue to investigate their Loewy structure. We show that in many cases their…

Representation Theory · Mathematics 2019-12-09 Thomas Breuer , László Héthelyi , Erzsébet Horváth , Burkhard Külshammer

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

Algebraic Geometry · Mathematics 2020-11-16 Hoon Hong , James Rohal , Mohab Safey El Din , Eric Schost

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2025-01-16 Andrei A. Bulatov