Related papers: Simplices and spectra of graphs, continued

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 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…

In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…

In this short note we adapt a proof by Bucher and Neofytidis to prove that the simplicial volume of 4-manifolds admitting an open book decomposition vanishes. In particular this shows that Quinns signature invariant, which detects the…

An n-simplex is called circumscriptible (or edge-incentric) if there is a sphere tangent to all its n(n + 1)/2 edges. We obtain a closed formula for the radius of the circumscribed sphere of the circumscriptible n-simplex, and also prove a…

We show that self-dual 2-forms in 2n dimensional spaces determine a $n^2-n+1$ dimensional manifold ${\cal S}_{2n}$ and the dimension of the maximal linear subspaces of ${\cal S}_{2n}$ is equal to the (Radon-Hurwitz) number of linearly…

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

Let $n$ and $k$ be integers with $n>2k, k\geq1$. We denote by $H(n, k)$ the $bipartite\ Kneser\ graph$, that is, a graph with the family of $k$-subsets and ($n-k$)-subsets of $[n] = \{1, 2, ... , n\}$ as vertices, in which any two vertices…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

For integers n\geq 1, k\geq 0, the stable Kneser graph SG_{n,k} (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n+k] and as edges disjoint pairs of n-subsets, where a stable n-subset is one that does not…

Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove…

We investigate when a complete graph $K_n$ with some edges deleted is determined by its adjacency spectrum. It is shown to be the case if the deleted edges form a matching, a complete graph $K_m$ provided $m \leq n-2$, or a complete…

We provide a clarification of the classification of two-dimensional algebras over an arbitrary base field. Using this clarification, we determine the number of non-isomorphic two-dimensional algebras over a finite field.

We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and…

In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…

Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional faces of Kn. We show that for planar convex sets, E(f0(Kn)) is increasing…

Motivated by previous efforts toward mathematically analyzing the treatment of monomials in spatial branch-and-bound, we study the convex hull of the graph of a simple monomial on a nonnegative box domain in arbitrary dimension, where at…

Just as knots and links can be algebraically described as certain morphisms in the category of tangles in 3 dimensions, compact surfaces smoothly embedded in R^4 can be described as certain 2-morphisms in the 2-category of `2-tangles in 4…

This paper extends results of Hatcher and Vogtmann's work "Cerf Theory for Graphs" to ribbon graphs. Given an orientable, punctured and basepointed surface Sigma, we prove that the space of ribbon graphs that can be drawn in Sigma is…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…