Related papers: Algorithmic aspects of arithmetical structures
Let $\phi \colon \Gamma_2 \rightarrow \Gamma_1$ be a harmonic morphism of connected graphs. We show that an arithmetical structure on $\Gamma_1$ can be pulled back via $\phi$ to an arithmetical structure on $\Gamma_2$. We then show that…
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symmetric matrices described by G. It is shown that for a…
In this article we continue with the study started in [1] of nearly Frobenius structures in some representative families of finite dimensional algebras, as the radical square zero algebras, string algebras and the toupie algebras. We prove…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
The algebras $A(\Gamma)$, where $\Gamma$ is a directed layered graph, were first constructed by I. Gelfand, S. Serconek, V. Retakh and R. Wilson. These algebras are generalizations of the algebras $Q_n$, which are related to factorizations…
We study online robust matrix completion on graphs. At each iteration a vector with some entries missing is revealed and our goal is to reconstruct it by identifying the underlying low-dimensional subspace from which the vectors are drawn.…
For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal I(M) generated by the boundaries of the circuits of the matroid. There is an isomorphism between the Orlik-Solomon algebra of a…
In this paper, we introduce the concepts of endomorphism operator, left averaging operator, differential operator and Rota-Baxter Operator, and we construct examples of these linear maps on associative algebras with a left identity, a…
A real square matrix $A$ is called a $Q$-matrix if the linear complementarity problem $LCP(A,q)$ has a solution for all $q \in \mathbb{R}^n$. This means that for every vector $q$ there exists a vector $x$ such that $x \geq 0, y=Ax+q\geq 0$…
We consider a family of pairs of m-by-p and m-by-q matrices, in which some entries are required to be zero and the others are arbitrary, with respect to transformations (A,B)--> (SAR,SBL) with nonsingular S, R, L. We prove that almost all…
Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
An algebraic structure related to discrete zero curvature equations is established. It is used to give an approach for generating master symmetries of first degree for systems of discrete evolution equations and an answer to why there exist…
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…
An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…
The presence of symmetries is one of the central structural features that make some integer programs challenging for state-of-the-art solvers. In this work, we study the efficacy of Linear Programming (LP) hierarchies in the presence of…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix…