10,482 research outputs found
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph
The Bubble-sort graph , is a Cayley graph over the
symmetric group generated by transpositions from the set . It is a bipartite graph containing all even cycles of
length , where . We give an explicit
combinatorial characterization of all its - and -cycles. Based on this
characterization, we define generalized prisms in , and
present a new approach to construct a Hamiltonian cycle based on these
generalized prisms.Comment: 13 pages, 7 figure
On the coarse classification of tight contact structures
We present a sketch of the proof of the following theorems: (1) Every
3-manifold has only finitely many homotopy classes of 2-plane fields which
carry tight contact structures. (2) Every closed atoroidal 3-manifold carries
finitely many isotopy classes of tight contact structures.Comment: 12 pages, to appear in the 2001 Georgia International Topology
Conference proceeding
The convex hull of a finite set
We study -separately convex hulls of finite
sets of points in , as introduced in
\cite{KirchheimMullerSverak2003}. When is considered as a
certain subset of matrices, this notion of convexity corresponds
to rank-one convex convexity . If is identified instead
with a subset of matrices, it actually agrees with the quasiconvex
hull, due to a recent result \cite{HarrisKirchheimLin18}.
We introduce " complexes", which generalize constructions. For a
finite set , a " -complex" is a complex whose extremal points
belong to . The "-complex convex hull of ", , is the union
of all -complexes. We prove that is contained in the
convex hull .
We also consider outer approximations to convexity based in the
locality theorem \cite[4.7]{Kirchheim2003}. Starting with a crude outer
approximation we iteratively chop off "-prisms". For the examples in
\cite{KirchheimMullerSverak2003}, and many others, this procedure reaches a
" -complex" in a finite number of steps, and thus computes the
convex hull.
We show examples of finite sets for which this procedure does not reach the
convex hull in finite time, but we show that a sequence of outer
approximations built with -prisms converges to a -complex. We
conclude that is always a " -complex", which has interesting
consequences
Lens Spaces and Handlebodies in 3D Quantum Gravity
We calculate partition functions for lens spaces L_{p,q} up to p=8 and for
genus 1 and 2 handlebodies H_1, H_2 in the Turaev-Viro framework. These can be
interpreted as transition amplitudes in 3D quantum gravity. In the case of lens
spaces L_{p,q} these are vacuum-to-vacuum amplitudes \O -> \O, whereas for
the 1- and 2-handlebodies H_1, H_2 they represent genuinely topological
transition amplitudes \O -> T^2 and \O -> T^2 # T^2, respectively.Comment: 14 pages, LaTeX, 5 figures, uses eps
Bucolic Complexes
We introduce and investigate bucolic complexes, a common generalization of
systolic complexes and of CAT(0) cubical complexes. They are defined as simply
connected prism complexes satisfying some local combinatorial conditions. We
study various approaches to bucolic complexes: from graph-theoretic and
topological perspective, as well as from the point of view of geometric group
theory. In particular, we characterize bucolic complexes by some properties of
their 2-skeleta and 1-skeleta (that we call bucolic graphs), by which several
known results are generalized. We also show that locally-finite bucolic
complexes are contractible, and satisfy some nonpositive-curvature-like
properties.Comment: 45 pages, 4 figure
Inverse problems for linear hyperbolic equations using mixed formulations
We introduce in this document a direct method allowing to solve numerically
inverse type problems for linear hyperbolic equations. We first consider the
reconstruction of the full solution of the wave equation posed in - a bounded subset of - from a partial
distributed observation. We employ a least-squares technique and minimize the
-norm of the distance from the observation to any solution. Taking the
hyperbolic equation as the main constraint of the problem, the optimality
conditions are reduced to a mixed formulation involving both the state to
reconstruct and a Lagrange multiplier. Under usual geometric optic conditions,
we show the well-posedness of this mixed formulation (in particular the inf-sup
condition) and then introduce a numerical approximation based on space-time
finite elements discretization. We prove the strong convergence of the
approximation and then discussed several examples for and . The
problem of the reconstruction of both the state and the source term is also
addressed
- …