Related papers: Equivariant log-concavity of graph matchings
Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave: 1. The matroid complex of independent subsets of E. 2. The broken circuit complex of…
Consider the intrinsic fundamental group \`a la Grothendieck of a linear category using connected gradings. In this article we prove that any full convex subcategory is incompressible, in the sense that the group map between the…
We show injectivity results for assembly maps using equivariant coarse homology theories with transfers. Our method is based on the descent principle and applies to a large class of linear groups or, more general, groups with finite…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
We provide and study an equivariant theory of group (co)homology of a group G with coefficients in a gamma-equivariant G-module A, when a separate group "gamma" acts on G and A, generalizing the classical Eilenberg-MacLane (co)homology of…
Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified…
In this article, we consider regular projective arithmetic schemes in the context of Arakelov geometry, any of which is endowed with an action of the diagonalisable group scheme associated to a finite cyclic group and with an equivariant…
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…
Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is…
A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
We show that shift equivalence of essential adjacency matrices coincides with gauge-equivariant homotopy equivalence of their stabilized graph C*-algebras. This provide the first equivalent formulation of shift equivalence of essential…
In this paper we address the classification problem for purely infinite simple Leavitt path algebras of finite graphs over a field $\ell$. Each graph $E$ has associated a Leavitt path $\ell$-algebra $L(E)$. There is an open question which…
We settle a conjecture of B\'ona regarding the log-concavity of a certain statistic on parking functions by utilizing recent log-concavity results on matroids. This result allows us to also prove that connected, labeled graphs graded by…
We develop a version of Hodge theory for a large class of smooth formally proper quotient stacks $X/G$ analogous to Hodge theory for smooth projective schemes. We show that the noncommutative Hodge-de Rham sequence for the category of…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…
We construct invariants of birational maps with values in the Kontsevich--Tschinkel group and in the truncated Grothendieck groups of varieties. These invariants are morphisms of groupoids and are well-suited to investigating the structure…
In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored graphs is itself the automorphism groups of an edge-colored…
It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…