Related papers: A few weight systems arising from intersection gra…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
We develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, we develop the thermodynamic formalism and show that, under…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
We study convolution algebras associated with Heckman-Opdam polynomials. For root systems of type BC we derive three continuous classes of positive convolution algebras (hypergroups) by interpolating the double coset convolution structures…
Using the formalism of species and twisted objects, we introduce two structures of cointeracting bialgebras on hypergraphs, induced by two notions of induced sub-hypergraphs. We study the associated unique morphisms of cointeracting…
We use a special kind of 2-dimensional extended Topological Quantum Field Theories (TQFTs), so-called open-closed TQFTs, in order to extend Khovanov homology from links to arbitrary tangles, not necessarily even. For every plane diagram of…
Although research on the control of networked systems has grown considerably, graph-theoretic and algorithmic studies on matrix-weighted graphs remain limited. To bridge this gap in the literature, this work introduces two algorithms-the…
We here give polynomial realizations of various Hopf algebras or bialgebras on Feynman graphs, graphs, posets or quasi-posets, that it to say injections of these objects into polynomial algebras generated by an alphabet. The alphabet here…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
This is the third revision. We study bases of Pfaffian systems for $A$-hypergeometric system. Gr\"obner deformations give bases. These bases also give those for twisted cohomology groups. For hypergeometric system associated to a class of…
In 2012, Cohen, Dasbach, and Russell presented an algorithm to construct a weighted adjacency matrix for a given knot diagram. In the case of pretzel knots, it is shown that after evaluation, the determinant of the matrix recovers the Jones…
We produce two-dimensional contiguous relations for generalized hypergeometric functions by starting with linearization coefficients for some continuous generalized hypergeometric orthogonal polynomials in the Askey-scheme.
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
The strong-coupling perturbation theory (SCPT) for correlated electron systems is extended to the case of full Coulomb interaction. The Coulomb mechanism of the orbital polarization is discussed and attention is paid to the importance of…
In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such that the weight of a maximum weight matching…
The interior polynomial and the exterior polynomial are generalizations of valuations on $(1/\xi,1)$ and $(1,1/\eta)$ of the Tutte polynomial $T_G(x,y)$ of graphs to hypergraphs, respectively. The pair of hypergraphs induced by a connected…
In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
The paper contains some new results and a review of recent achievements, concerning the multisupport solutions to matrix models. In the leading order of the 't Hooft expansion for matrix integral, these solutions are described by…
We consider elliptic transmission problems with complex coefficients across an interface. Under proper transmission conditions, that extend known conditions for well-posedness, and sub-ellipticity we derive microlocal and local Carleman…