Related papers: Rational Mixed Tate Motivic Graphs
We prove several results concerning cycle tilings and $H$-factors in digraphs. We provide a minimum semi-degree condition for forcing a digraph to contain a given spanning collection of vertex-disjoint orientations of cycles. Our result is…
In a number of recent works [6, 7] the authors have introduced and studied a functor $\mathcal{F}_k$ which associates to each loose graph $\Gamma$ -which is similar to a graph, but where edges with $0$ or $1$ vertex are allowed - a…
We consider proper, algebraic semismall maps f from a complex algebraic manifold X. We show that the topological Decomposition Theorem implies a "motivic" decomposition theorem for the rational algebraic cycles of X and, in the case X is…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
In this paper we give some evidence for the Tate (and Hodge) conjecture(s) for a class of Hilbert modular fourfolds X, whose connected components arise as arithmetic quotients of the fourfold product of the upper half plane by congruence…
In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, apart from five exceptional graphs. This conjecture has recently been settled for graphs defined by intersecting set systems, which feature…
For a smooth, projective complex variety, we introduce several mixed Hodge structures associated to higher algebraic cycles. Most notably, we introduce a mixed Hodge structure for a pair of higher cycles which are in the refined normalized…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in…
Conforti et al. give a compact extended formulation for a class of bimodular-constrained integer programs, namely those that model the stable set polytope of a graph with no disjoint odd cycles. We extend their techniques to design compact…
A period is a complex number arising as the integral of a rational function with algebraic number coefficients over a rationally-defined region. Although periods are typically transcendental numbers, there is a conjectural Galois theory of…
We compute the algebraic $K$-theory of some classes of surfaces defined over finite fields. We achieve this by first calculating the motivic cohomology groups and then studying the motivic Atiyah-Hirzebruch spectral sequence. In an…
In this paper, we will investigate a harmonic cycle (discrete harmonic form). With a CW-complex, we can construct the combinatorial Laplacian operator. The kernel of the operator is the harmonic space, the set of harmonic cycles, and is…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
The Hochschild and (cotriple) cyclic homologies of crossed modules of (not-necessarily-unital) associative algebras are investigated. Wodzicki's excision theorem is extended for inclusion crossed modules in the category of crossed modules…
We will show that the singular cohomology groups of a smooth quasi-projective complex variety relative to a normal crossing divisor can be described in terms of delta-admissible chains. Roughly speaking, a delta-admissible chain is a…