Related papers: On the consistency problem for modular lattices an…
The natural join and the inner union operations combine relations of a database. Tropashko and Spight [24] realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices.…
In many matching markets--such as athlete recruitment or academic admissions--participants on one side are evaluated by attribute vectors known to the other side, which in turn applies individual \emph{salience vectors} to assign relative…
The main objective of this paper is to study the relationship between a solvable evolution algebra and its subalgebra lattice, emphasizing two of its main properties: distributivity and modularity. First, we will focus on the nilpotent…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
The idea of modular invariance provides a novel explanation of flavour mixing. Within the context of finite modular symmetries $\Gamma_N$ and for a given element $\gamma \in \Gamma_N$, we present an algorithm for finding stabilisers…
We establish conditions under which lattices in certain simple Lie groups are profinitely solitary in the absolute sense, so that the commensurability class of the profinite completion determines the commensurability class of the group…
In 1970s, a method was developed for integration of nonlinear equations by means of algebraic geometry. Starting from a Lax representation with spectral parameter, the algebro-geometric method allows to solve the system explicitly in terms…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
For modules over an artin algebra a linear stability condition is given by a "central charge" and a nonlinear stability condition is given by the wall-crossing sequence of a "green path". Finite Harder-Narasimhan stratifications of the…
We investigate, theoretically and experimentally,the properties of diffraction spectra of Fibonacci lattices with arbitrary spacings. We show that, by means of a suitable composition rule, a Fibonacci sequence can be mapped into another one…
Let $G$ be a reductive algebraic group over a $p$-adic field or number field $K$, and let $V$ be a $K$-linear faithful representation of $G$. A lattice $\Lambda$ in the vector space $V$ defines a model $\hat{G}_{\Lambda}$ of $G$ over…
Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…
In this paper we treat faithful actions of simple algebraic groups on irreducible modules and on the associated Grassmannian varieties. By explicit calculation, we show that in each case, with essentially one exception (only in…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
Let A be a connected hereditary artin algebra. We show that the set of functorially finite torsion classes of A-modules is a lattice if and only if A is either representation-finite (thus a Dynkin algebra) or A has only two simple modules.…
We show that for a large class of varieties of algebras, the equational theory of the congruence lattices of the members is not finitely based.
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…
The stability of topological persistence is one of the fundamental issues in topological data analysis. Numerous methods have been proposed to address the stability of persistent modules or persistence diagrams. Recently, the concept of…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is NP-complete for non-solvable groups. Since then, several…