Related papers: A combinatorial $K$-theory perspective on the Edge…
The problem of graph reconstruction has been studied in its various forms over the years. In particular, the Reconstruction Conjecture, proposed by Ulam and Kelly in 1942, has attracted much research attention and yet remains one of the…
The present study was concerned with network failure problems for simple connected undirected graphs. A connected graph becomes unconnected through edge failure, under the assumptions that only edges can fail and each edge has an identical…
In this paper, we give an overview of some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics. The motivations for this work come from Computer…
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We establish formulas for computation of the higher algebraic $K$-groups of the endomorphism rings of objects linked by a morphism in an additive category. Let ${\mathcal C}$ be an additive category, and let $Y\ra X$ be a covariant morphism…
In recent years the theory of dendroidal sets has emerged as an important framework for higher algebra. In this article we introduce the concept of a $C^*$-algebraic drawing of a dendroidal set. It depicts a dendroidal set as an object in…
In this article functorial Feynman rules are introduced as large generalizations of physicists Feynman rules, in the sense that they can be applied to arbitrary classes of hypergraphs, possibly endowed with any kind of structure on their…
We introduce and study matrix transfers to achieve elementary models for bivariant $K$-theory. They share lots of common properties with Voevodsky's framed correspondences and lead to symmetric matrix motives of algebraic varieties…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…
Let k be a regular F_p-algebra, let A = k[x,y]/(x^b - y^a) be the coordinate ring of a planar cuspical curve, and let I = (x,y) be the ideal that defines the cusp point. We give a formula for the relative K-groups K_q(A,I) in terms of the…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
This paper investigates the $\mathrm{K}$-theory of twisted groupoid $\mathrm{C}^*$-algebras. It is shown that a homotopy of twists on an ample groupoid satisfying the Baum-Connes conjecture with coefficients gives rise to an isomorphism…
Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
Commutative $d$-torsion $K$-theory is a variant of topological $K$-theory constructed from commuting unitary matrices of order dividing $d$. Such matrices appear as solutions of linear constraint systems that play a role in the study of…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…