Related papers: Simplices and spectra of graphs

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

Let $f\in\Sigma_{n,2d}$ be a sum of squares. The Gram spectrahedron of $f$ is a compact, convex set that parametrizes all sum of squares representations of $f$. Let $F\subseteq\mathrm{Gram}(f)$ be a face of its Gram spectrahedron. We are…

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…

The k-th power of a n-vertex graph X is the iterated cartesian product of X with itself. The k-th symmetric power of X is the quotient graph of certain subgraph of its k-th power by the natural action of the symmetric group. It is natural…

In this paper we show that for each $n$, there exists a simple graph whose reliability polynomial has at least $n$ inflection points.

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…

We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…

We study simplices with equiareal faces in the Euclidean 3-space by means of elementary geometry. We present an unexpectedly simple proof of the fact that, if such a simplex is non-degenerate, than every two of its faces are congruent. We…

Let $\Sigma$ be an $n$-vertex controllable or almost controllable signed bipartite graph, and let $\Delta_\Sigma$ denote the discriminant of its characteristic polynomial $\chi(\Sigma; x)$. We prove that if (\rmnum{1}) the integer $2^{…

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

A manifold is multisymplectic, or more specifically n-plectic, if it is equipped with a closed nondegenerate differential form of degree n+1. In our previous work with Baez and Hoffnung, we described how the `higher analogs' of the…

We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with…