Related papers: Rational Mixed Tate Motivic Graphs
We study the depth filtration on multiple zeta values, the motivic Galois group of mixed Tate motives over $\mathbb{Z}$ and the Grothendieck-Teichm\"uller group, and its relation to modular forms. Using period polynomials for cusp forms for…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more general result covering canonical graph decompositions like…
In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…
The syntactic nature of logic and computation separates them from other fields of mathematics. Nevertheless, syntax has been the only way to adequately capture the dynamics of proofs and programs such as cut-elimination, and the finiteness…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
The Tate conjecture has two parts: i) Tate classes are linear combination of algebraic classes, ii) semisimplicity of Galois representations (for smooth projective varieties). B. Moonen proved that i) implies ii) in characteristic 0, using…
In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as ucycles or generalized deBruijn cycles or…
It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…
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 make explicit Serre's generalization of the Sato-Tate conjecture for motives, by expressing the construction in terms of fiber functors from the motivic category of absolute Hodge cycles into a suitable category of Hodge structures of…
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…
A natural place to study the Chow ring of the classifying space $BG$, for $G$ a linear algebraic group, is Voevodsky's triangulated category of motives, inside which Morel and Voevodsky, and Totaro have defined motives $M(BG)$ and…
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We study the monodromies and the limit mixed Hodge structures of families of complete intersection varieties over a punctured disk in the complex plane. For this purpose, we express their motivic nearby fibers in terms of the geometric data…