相关论文: The algebra of balanced dessins

A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

These notes deal with finite-dimensional normed algegras, some basic examples, and the definition of the spectrum.

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

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 explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion…

Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph…

Balanced truncation, a technique from robust control theory, is a systematic method for producing simple approximate models of complex linear systems. This technique may have significant applications in physics, particularly in the study of…

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

We derive the algebraic relations of alternating and non-alternating finite harmonic sums up to the sums of depth~6. All relations for the sums up to weight~6 are given in explicit form. These relations depend on the structure of the index…

In this paper we associate to a dessin d'enfant an associative algebra, called a Brauer configuration algebra. This is an algebra given by quiver and relations induced by the monodromy of the dessin d'enfant. We show that the dimension of…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering…

Let $\ell$ denote a positive integer. A connected graph $\G$ of diameter at least $\ell$ is said to be $\ell${\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\G$ such that $d(u,v)=\ell$, the number of vertices closer to…

A map is a 2-cell decomposition of an orientable closed surface. A dessin is a bipartite map with a fixed colouring of vertices. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts transitively on the…

Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…

Betweenness as a relation between three individual points has been widely studied in geometry and axiomatized by several authors in different contexts. The article proposes a more general notion of betweenness as a relation between three…

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…

This survey provides an overview of common applications, both implicit and explicit, of "tensors" and "tensor products" in the fields of data science and statistics. One goal is to reconcile seemingly distinct usages of the term "tensor" in…