Related papers: Algorithmic aspects of arithmetical structures
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
We obtain a complete structural characterization of Cohn-Leavitt algebras over no-exit objects as graded involutive algebras. Corollaries of this result include graph-theoretic conditions characterizing when a Leavitt path algebra is a…
Let A be an algebra whose group of units U(A) satisfies a Laurent polynomial identity (LPI). We establish conditions on these polynomials in such a way that nil-generated algebras and group algebras with torsion groups over infinite fields…
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of…
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensively studied by theoreticians and practitioners alike. The…
We describe the mathematical properties of pairwise comparisons matrices with coefficients in an arbitrary group. We provide a vocabulary adapted for the description of main algebraic properties of inconsistency maps, describe an example…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…
The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
In 2005, building on his own recent work and that of F. Zanello, A. Iarrobino discovered some constructions that, he conjectured, would yield level algebras with non-unimodal Hilbert functions. This thesis provides proofs of non-unimodality…
In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…
For an arbitrary group, the subgroups form a lattice with order determined by set inclusion. Not every lattice is isomorphic to the subgroup lattice for a group. However, Birkhoff and Frink proved that any compactly generated lattice is…
On the set of mappings of the given set, we define the product of mappings. If A is associative algebra, then we consider the set of matrices, whose elements are linear mappings of algebra A. In algebra of matrices of linear mappings we…
Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a…
Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…
We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…
Quadratic algebras related to some classes of finite left non-degenerate solutions (X,r) of the Yang--Baxter equation have been intensively studied since they are the associative ring-theoretical tool to study solutions. These are the…
In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to…