40,588 research outputs found
Stacked polytopes and tight triangulations of manifolds
Tightness of a triangulated manifold is a topological condition, roughly
meaning that any simplexwise linear embedding of the triangulation into
euclidean space is "as convex as possible". It can thus be understood as a
generalization of the concept of convexity. In even dimensions,
super-neighborliness is known to be a purely combinatorial condition which
implies the tightness of a triangulation.
Here we present other sufficient and purely combinatorial conditions which
can be applied to the odd-dimensional case as well. One of the conditions is
that all vertex links are stacked spheres, which implies that the triangulation
is in Walkup's class . We show that in any dimension
\emph{tight-neighborly} triangulations as defined by Lutz, Sulanke and Swartz
are tight.
Furthermore, triangulations with -stacked vertex links and the centrally
symmetric case are discussed.Comment: 28 pages, 2 figure
On the Spectral Gap of a Quantum Graph
We consider the problem of finding universal bounds of "isoperimetric" or
"isodiametric" type on the spectral gap of the Laplacian on a metric graph with
natural boundary conditions at the vertices, in terms of various analytical and
combinatorial properties of the graph: its total length, diameter, number of
vertices and number of edges. We investigate which combinations of parameters
are necessary to obtain non-trivial upper and lower bounds and obtain a number
of sharp estimates in terms of these parameters. We also show that, in contrast
to the Laplacian matrix on a combinatorial graph, no bound depending only on
the diameter is possible. As a special case of our results on metric graphs, we
deduce estimates for the normalised Laplacian matrix on combinatorial graphs
which, surprisingly, are sometimes sharper than the ones obtained by purely
combinatorial methods in the graph theoretical literature
Quantum Graphs II: Some spectral properties of quantum and combinatorial graphs
The paper deals with some spectral properties of (mostly infinite) quantum
and combinatorial graphs. Quantum graphs have been intensively studied lately
due to their numerous applications to mesoscopic physics, nanotechnology,
optics, and other areas.
A Schnol type theorem is proven that allows one to detect that a point
belongs to the spectrum when a generalized eigenfunction with an subexponential
growth integral estimate is available. A theorem on spectral gap opening for
``decorated'' quantum graphs is established (its analog is known for the
combinatorial case). It is also shown that if a periodic combinatorial or
quantum graph has a point spectrum, it is generated by compactly supported
eigenfunctions (``scars'').Comment: 4 eps figures, LATEX file, 21 pages Revised form: a cut-and-paste
blooper fixe
Regularity of Edge Ideals and Their Powers
We survey recent studies on the Castelnuovo-Mumford regularity of edge ideals
of graphs and their powers. Our focus is on bounds and exact values of and the asymptotic linear function , for in terms of combinatorial data of the given graph Comment: 31 pages, 15 figure
Infinite combinatorial issues raised by lifting problems in universal algebra
The critical point between varieties A and B of algebras is defined as the
least cardinality of the semilattice of compact congruences of a member of A
but of no member of B, if it exists. The study of critical points gives rise to
a whole array of problems, often involving lifting problems of either diagrams
or objects, with respect to functors. These, in turn, involve problems that
belong to infinite combinatorics. We survey some of the combinatorial problems
and results thus encountered. The corresponding problematic is articulated
around the notion of a k-ladder (for proving that a critical point is large),
large free set theorems and the classical notation (k,r,l){\to}m (for proving
that a critical point is small). In the middle, we find l-lifters of posets and
the relation (k, < l){\to}P, for infinite cardinals k and l and a poset P.Comment: 22 pages. Order, to appea
Computation and Homotopical Applications of Induced Crossed Modules
We explain how the computation of induced crossed modules allows the
computation of certain homotopy 2-types and, in particular, second homotopy
groups. We discuss various issues involved in computing induced crossed modules
and give some examples and applications.Comment: 15 pages, xypic, latex2
The topological strong spatial mixing property and new conditions for pressure approximation
In the context of stationary nearest-neighbour Gibbs measures
satisfying strong spatial mixing, we present a new combinatorial
condition (the topological strong spatial mixing property (TSSM)) on the
support of sufficient for having an efficient approximation algorithm for
topological pressure. We establish many useful properties of TSSM for studying
strong spatial mixing on systems with hard constraints. We also show that TSSM
is, in fact, necessary for strong spatial mixing to hold at high rate. Part of
this work is an extension of results obtained by D. Gamarnik and D. Katz
(2009), and B. Marcus and R. Pavlov (2013), who gave a special representation
of topological pressure in terms of conditional probabilities.Comment: 40 pages, 8 figures. arXiv admin note: text overlap with
arXiv:1309.1873 by other author
- …