Related papers: Tutte Short Exact Sequences of Graphs
Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…
Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $G$-parking function (with respect to $q$) was independently developed and studied by various authors, and has recently gained renewed attention. This…
Interaction between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…
Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
We present some observations on a restricted variant of unitary Cayley graphs modulo n, and the implications for a decomposition of elements of symplectic operators over the integers modulo n. We define quadratic unitary Cayley graphs G_n,…
We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…
In this paper, we give a new proof on a Theorem of Tutte which says that the determinants of the adjacency matrices of two hypomorphic graphs are the same. We also study the lowest eigenvectors.
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
Let $G$ be a connected reductive complex algebraic group, and $E$ a complex elliptic curve. Let $G_E$ denote the connected component of the trivial bundle in the stack of semistable $G$-bundles on $E$. We introduce a complex analytic…
We study coherent systems of type $(n,d,n+1)$ on a Petri curve $X$ of genus $g\ge2$. We describe the geometry of the moduli space of such coherent systems for large values of the parameter $\alpha$. We determine the top critical value of…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
We study the computation of the Tutte polynomials of fan-like graphs and obtain expressions of their Tutte polynomials via generating functions. As applications, Tutte polynomials, in particular, the number of spanning trees, of two kinds…
Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each…
We prove that the category of countable Tate modules over an arbitrary discrete ring embeds fully faithfully into that of condensed modules. If the base ring is of finite type, we characterize the essential image as generated by the free…
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of…