English
Related papers

Related papers: On big Ramsey degrees for binary free amalgamation…

200 papers

Let $\mathbb{K}$ be a field, $R$ be an associative and commutative $\mathbb{K}$-algebra and $L$ be a Lie algebra over $\mathbb{K}$. We give some descriptions of injections from $L$ to Lie algebra of $\mathbb{K}$-derivations of $R$ in the…

Rings and Algebras · Mathematics 2013-05-13 Ievgen Makedonskyi

We realize the $\mathbb{F}_q$-algebra $M(\mathbb{F}_q)$ studied by von Neumann and Halperin as the Fra\"iss\'e limit of the class of finite-dimensional matrix algebras over a finite field $\mathbb{F}_q$ equipped with the rank metric. We…

Rings and Algebras · Mathematics 2021-05-24 Aaron Anderson

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

Logic · Mathematics 2024-07-16 Michael C. Laskowski , Danielle S. Ulrich

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

Rings and Algebras · Mathematics 2022-06-16 A. J. Kanel-Belov , I. A. Melnikov , I. V. Mitrofanov

Suppose that M is an infinite structure with finite relational vocabulary such that every relation symbol has arity at most 2. If M is simple and homogeneous then its complete theory is supersimple with finite SU-rank which cannot exceed…

Logic · Mathematics 2015-04-08 Vera Koponen

We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a…

In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.

Group Theory · Mathematics 2025-10-29 Carmine Monetta , Víctor Sotomayor

We present a unified apoach to the study of separable and Frobenius algebras. The crucial observation is thsat both cases are related to the nonlinear equation $R^{12}R^{23}=R^{23}R^{13}=R^{13}R^{12}$, called the FS-equation. Given a…

Quantum Algebra · Mathematics 2009-09-25 S. Caenepeel , B. Ion , G. Militaru

We investigate the saturation rank of a finite group scheme, defined over an algebraically closed field $\Bk$ of positive characteristic $p$. We begin by exploring the saturation rank for finite groups and infinitesimal group schemes.…

Representation Theory · Mathematics 2017-01-12 Yang Pan

The objects of study in this paper are Hopf algebras $H$ which are finitely generated algebras over an algebraically closed field and are extensions of a commutative Hopf algebra by a finite dimensional Hopf algebra. Basic structural and…

Quantum Algebra · Mathematics 2019-07-25 Kenneth Brown , Miguel Couto

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

Combinatorics · Mathematics 2018-07-06 Dragan Mašulović , Bojana Pantić

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

Group Theory · Mathematics 2007-05-23 W. Ethan Duckworth

A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…

Logic in Computer Science · Computer Science 2019-09-09 Matthew Moore

Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension…

Commutative Algebra · Mathematics 2011-04-05 Aron Simis , Rafael H. Villarreal

Let $k$ be a perfect field such that for every $n$ there are only finitely many field extensions, up to isomorphism, of $k$ of degree $n$. If $G$ is a reductive algebraic group defined over $k$, whose characteristic is very good for $G$,…

Group Theory · Mathematics 2020-05-19 Shripad M. Garge , Anupam Singh

Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…

Representation Theory · Mathematics 2018-08-07 Alex Dugas

Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…

Formal Languages and Automata Theory · Computer Science 2020-05-22 Aalok Thakkar

This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…

Logic · Mathematics 2026-04-21 Juanda Kelana Putra , Richard Smolka

We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Automates et Th\'eorie Descriptive, Ph. D. Thesis, Universit\'e Paris 7, March…

Logic in Computer Science · Computer Science 2008-12-18 Olivier Finkel

We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…

Computational Complexity · Computer Science 2007-05-23 Ming Li , Paul Vitanyi