Related papers: Algorithmic aspects of arithmetical structures
A pair $(A,B)$ of square $(0,1)$-matrices is called a \emph{Lehman pair} if $AB^T=J+kI$ for some integer $k\in\{-1,1,2,3,\ldots\}$. In this case $A$ and $B$ are called \emph{Lehman matrices}. This terminology arises because Lehman showed…
Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…
This survey presents a necessarily incomplete (and biased) overview of results at the intersection of arithmetic circuit complexity, structured matrices and deep learning. Recently there has been some research activity in replacing…
A special class of Jordan algebras over a field $F$ of characteristic zero is considered. Such an algebra consists of an $r$-dimensional subspace of the vector space of all square matrices of a fixed order $n$ over $F$. It contains the…
Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying an algebraic…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.
A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…
An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…
A method is obtained to compute the maximum number of functionally independent invariant functions under the action of a linear algebraic group as long as its Lie algebra admits a base of square-zero matrices. Some applications are also…
These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…
We study classical twists of Lie bialgebra structures on the polynomial current algebra $\mathfrak{g}[u]$, where $\mathfrak{g}$ is a simple complex finite-dimensional Lie algebra. We focus on the structures induced by the so-called…
The nonnegative integer rank of a matrix is a variant of the classical nonnegative rank, introduced in the 1980s, where factorizations are required to have integer entries. While computing nonnegative integer rank is generally very hard, we…
Motivated by M-theory, we define a new type of non-associative algebra involving usual and cubic matrices at the same time. The resulting algebra can be regarded as a two-term truncated $L_\infty$ algebra giving rise to a fundamental…
In this paper, we study an impact of Leibniz algebras on the algebraic structure of $\mathbb{N}$-graded vertex algebras. We provide easy ways to characterize indecomposable non-simple $\mathbb{N}$-graded vertex algebras…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
For a finite dimensional simple complex Lie algebra $\mathfrak{g}$, Lie bialgebra structures on $\mathfrak{g}[[u]]$ and $\mathfrak{g}[u]$ were classified by Montaner, Stolin and Zelmanov. In our paper, we provide an explicit algorithm to…
Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…