Related papers: Gauge-string duality, monomial bases and graph det…
Let \(\T\) be a commutative ternary \(\Gm\)-semiring in the sense of the triadic, \(\Gm\)-parametrized multiplication \(\{a,b,c\}_{\gamma}\). Building on the affine \(\Gm\)-spectrum \(\SpecG(\T)\), the structure sheaf, and the equivalence…
An undirected graphical model is a joint probability distribution defined on an undirected graph G*, where the vertices in the graph index a collection of random variables and the edges encode conditional independence relationships among…
Graph Neural Networks (GNNs) are increasingly becoming the favorite method for graph learning. They exploit the semi-supervised nature of deep learning, and they bypass computational bottlenecks associated with traditional graph learning…
We explore a family of monomial ideals derived as Gr\"obner degenerations of determinantal ideals. These ideals, previously examined as block diagonal matching field ideals within the realm of toric degenerations of Grassmannians, are…
Based on the superconformal algebra we construct a dual operator that introduces a grading among bosonic generators independent of the boson/fermion grading of the superalgebra. This dual operator allows us to construct an action that is…
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…
We study the $a$-sequence $(a_0(G), a_1(G), \cdots)$ of a finite simple graph $G$, defined recursively through a combinatorial rule and known to coincide with the sequence of rational Betti numbers of the real toric variety associated with…
Linear structural equation models, which relate random variables via linear interdependencies and Gaussian noise, are a popular tool for modeling multivariate joint distributions. These models correspond to mixed graphs that include both…
A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that…
Ideas from deformation quantization applied to algebras with one generator lead to methods to treat a nonlinear flat connection. It provides us elements of algebras to be parallel sections. The moduli space of the parallel sections is…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
Commutative sets of Jucys-Murphyelements for affine braid groups of $A^{(1)},B^{(1)},C^{(1)},D^{(1)}$ types were defined. Construction of $R$-matrix representations of the affine braid group of type $C^{(1)}$ and its distinguish commutative…
In contrast to the determinant, no algorithm is known for the exact determination of the permanent of a square matrix that runs in time polynomial in its dimension. Consequently, non interacting fermions are classically efficiently…
We introduce monomial divisibility diagrams (MDDs), a data structure for monomial ideals that supports insertion of new generators and fast membership tests. MDDs stem from a canonical tree representation by maximally sharing equal…
Assume that A is a unital separable simple C*-algebra with real rank zero, stable rank one, strict comparison of projections, and that its tracial simplex T(A) has a finite number of extremal points. We prove that every self-adjoint element…
Modular graph forms (MGFs) are a class of non-holomorphic modular forms which naturally appear in the low-energy expansion of closed-string genus-one amplitudes and have generated considerable interest from pure mathematicians. MGFs satisfy…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
Let $F$ be a field of characteristic zero, $G$ be a group and $R$ be the algebra $M_n(F)$ with a $G$-grading. Bahturin and Drensky proved that if $R$ is an elementary and the neutral component is commutative then the graded identities of…