Related papers: Rational Mixed Tate Motivic Graphs
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
Using the block filtration as a realisation of the coradical filtration, we study the discrepancy between the depth filtration and the coradical filtration for motivic multiple zeta values. We construct an explicit dictionary between a…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
We study zero cycles on rationally connected varieties defined over characteristic zero Laurent fields with algebraically closed residue fields. We show that the degree map induces an isomorphism for rationally connected threefolds defined…
The appearance of multiple zeta values in anomalous dimensions and $\beta$-functions of renormalizable quantum field theories has given evidence towards a motivic interpretation of these renormalization group functions. In this paper we…
This is my habilitation thesis. As the tradition wants, I tried to give an introduction of my field of research. I post it on the ArXiv with the hope it can be useful to young researchers looking for a short and friendly text on…
We formulate an analogue of Tate conjecture on algebraic cycles, for the log geometry over a finite field. We show that the weight-monodromy conjecture follows from this conjecture and from the semi-simplicity of the Frobenius action. This…
In this paper, we present an application of mirror symmetry to arithmetic geometry. The main result is the computation of the period of a mixed Hodge structure, which lends evidence to its expected motivic origin. More precisely, given a…
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…
We introduce a theory of motivic cohomology for quasi-compact quasi-separated schemes, which generalises the construction of Elmanto--Morrow in the case of schemes over a field. Our construction is non-$\mathbb{A}^1$-invariant in general,…
In this article we study in detail the category of noncommutative motives of separable algebras Sep(k) over a base field k. We start by constructing four different models of the full subcategory of commutative separable algebras CSep(k).…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
In this paper we give a graph theoretic combinatorial interpretation for the cluster variables that arise in most cluster algebras of finite type. In particular, we provide a family of graphs such that a weighted enumeration of their…
George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…
In this paper we define the triangulated category of motives over a simplicial scheme. The morphisms between the Tate objects in this category compute the motivic cohomology of the underlying scheme. In the last section we consider the…
Recent large-scale reasoning models have achieved state-of-the-art performance on challenging mathematical benchmarks, yet the internal mechanisms underlying their success remain poorly understood. In this work, we introduce the notion of a…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…