Related papers: On shelling and flag vectors
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
A family of graphs optimized as the topologies for supercomputer interconnection networks is proposed. The special needs of such network topologies, minimal diameter and mean path length, are met by special constructions of the weight…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…
This contribution extends linear models for feature vectors to sublinear models for graphs and analyzes their properties. The results are (i) a geometric interpretation of sublinear classifiers, (ii) a generic learning rule based on the…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…
Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…
We define a version of spectral invariant in the vortex Floer theory for a $G$-Hamiltonian manifold $M$. This defines potentially new (partial) symplectic quasi-morphism and quasi-states when $M//G$ is not semi-positive. We also establish a…
We study vector bundles on flag varieties over an algebraically closed field $k$. In the first part, we suppose $G=G_k(d,n)$ $(2\le d\leq n-d)$ to be the Grassmannian manifold parameterizing linear subspaces of dimension $d$ in $k^n$, where…
In the present paper, we propose a new construction of quantum Markov fields on arbitrary connected, infinite, locally finite graphs. The construction is based on a specific tessellation on the considered graph, that allows us to express…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We first describe the tangent space to the affine flag manifold associated to a simple algebraic group over $\mathbb{C}$ at the distinguished point starting from standard definitions. We then construct projective lines in the affine flag…
Givental's recursion relations for the flag varieties $G/B$ are established.
A geometric framework for describing quantum particles on a possibly curved background is proposed. Natural constructions on certain distributional bundles (`quantum bundles') over the spacetime manifold yield a quantum ``formalism'' along…
We classify all products of flag varieties with finitely many orbits under the diagonal action of the general linear group. We also classify the orbits in each case and construct explicit representatives. This generalizes the classical…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…