Related papers: A Witt type formula
We investigate Gauss maps of (not necessarily normal) projective toric varieties over an algebraically closed field of arbitrary characteristic. The main results are as follows: (1) The structure of the Gauss map of a toric variety is…
The aim of this paper is to organize some known mass formulas arising from a definite central division algebra over a global field and to deduce some more new ones.
We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
In the recent years, Hopf algebras have been introduced to describe certain combinatorial properties of quantum field theories. I will give a basic introduction to these algebras and review some occurrences in particle physics.
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
The method of direct calculation of the group of $\mathbb R$-algebra automorphisms of a Weil algebra is presented in detail. The paper is focused on the case of a one-componental group and presents two cases of values of the determinant of…
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…
This paper presents fundamental algorithms for the computational theory of quadratic forms over number fields. In the first part of the paper, we present algorithms for checking if a given non-degenerate quadratic form over a fixed number…
Generalized symmetry integrability test for discrete equations on the square lattice is studied. Integrability conditions are discussed. A method for searching higher symmetries (including non-autonomous ones) for quad graph equations is…
In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open problems.
This article investigates the homotopy theory of simplicial commutative algebras with a view to homological applications.
In this paper, motivated by the theory of operads and PROPs we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…