Related papers: A weighted graph problem from commutative algebra
We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…
Let $G$ be a simple graph on the vertex set $V(G) = [n] = \{1,...,n\}$ and edge ideal $E(G)$. We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges $\{i, j\}$ and $\{k,…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When…
In this paper we propose an algebraic formalization of connectors in the quantitative setting, in order to address their non-functional features in architectures of component-based systems. We firstly present a weighted Algebra of…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
A method of classification of integrable equations on quad-graphs is discussed based on algebraic ideas. We assign a Lie ring to the equation and study the function describing the dimensions of linear spaces spanned by multiple commutators…
We study the images of polynomial maps over algebraically closed division rings. Our first result generalizes the classical Ax-Grothendieck theorem: We show that if $ f_1, \ldots, f_m $ are elements of the free associative algebra $…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
We study "holomorphic quadratic differentials" on graphs. We relate them to the reactive power in an LC circuit, and also to the chromatic polynomial of a graph. Specifically, we show that the chromatic polynomial $\chi$ of a graph $G$, at…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…
In this paper we give a toric representation of the associated ring of a polyomino which is obtained by removing a convex polyomino from its ambient rectangle.