相关论文: Pseudograph and its associated real toric manifold

Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…

For a simple and connected graph, a new graph invariant $s_{\alpha}^{*}(G)$, defined as the sum of powers of the eigenvalues of the normalized Laplacian matrix, has been introduced by Bozkurt and Bozkurt in [7]. Lower and upper bounds have…

Let $\Delta$ be a 1-dimensional simplicial complex. Then $\Delta$ may be identified with a finite simple graph $G$. In this article, we investigate the toric ring $R_G$ of $G$. All graphs $G$ such that $R_G$ is a normal domain are…

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal property that essentially any multiplicative graph or network invariant with a deletion and contraction reduction must be an evaluation of…

We classify all regular polyhedra according to their type i.e., the collection of numbers of common neighbours that any pair of distinct vertices may have (polyhedra are planar, $3$-connected graphs). As an application, we recover the…

The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positively and negatively pseudo-inverse matrices and graphs. We…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…

Quadratic algebras associated to graphs have been introduced by I. Gelfand, S. Gelfand, and Retakh in connection with decompositions of noncommutative polynomials. Here we show that, for each graph with rare triangular subgraphs, the…

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

This paper is devoted to some rotationally symmetric classes of graphs denoted in literature as convex polytope graphs. Exact value of equidistant dimension is found for $T_n$. Next, for even $n$ exact values are found for $R''_n$ and…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Let $\mathfrak g$ be a finite-dimensional Lie algebra. The symmetric algebra $\mathcal S(\mathfrak g)$ is equipped with the standard Lie-Poisson bracket. In this paper, we elaborate on a surprising observation that one naturally associates…

We establish a new and surprisingly strong link between two previously unrelated theories: the theory of moduli spaces of curves ${\mathcal M}_{g,n}$ (which, according to Penner, is controlled by the ribbon graph complex) and the homotopy…

A new construction of the associahedron was recently given by Arkani-Hamed, Bai, He, and Yan in connection with the physics of scattering amplitudes. We show that their construction (suitably understood) can be applied to construct…

We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…

We study the $a$-sequence $(a_0(G), a_1(G), \cdots)$ of a finite simple graph $G$, defined recursively through a combinatorial rule and known to coincide with the sequence of rational Betti numbers of the real toric variety associated with…

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

We find new properties of the topological transition polynomial of embedded graphs, $Q(G)$. We use these properties to explain the striking similarities between certain evaluations of Bollob\'as and Riordan's ribbon graph polynomial,…