English
Related papers

Related papers: Band Unfoldings and Prismatoids: A Counterexample

200 papers

An exact conservative remapping scheme requires overlaps between two meshes and a reconstruction scheme on the old cells (Lagrangian mesh). While the are intensive discussion on reconstruction schemes, there are relative sparse discussion…

Numerical Analysis · Mathematics 2016-05-31 Xihua Xu , Shengxin Zhu

Each extreme edge of the Newton diagram of a plurisubharmonic polynomial on $\mathbb{C}^2$ gives rise to a plurisubharmonic polynomial. It is tempting to believe that the union of the extreme edges or the convex hull of said union will do…

Complex Variables · Mathematics 2017-10-04 Lars Simon , Berit Stensønes

The phenomenon of a topological monodromy in integrable Hamiltonian and nonholonomic systems is discussed. An efficient method for computing and visualizing the monodromy is developed. The comparative analysis of the topological monodromy…

Dynamical Systems · Mathematics 2015-06-18 Alexey V. Bolsinov , Alexander A. Kilin , Alexey O. Kazakov

This article exhibits a 4-dimensional combinatorial polytope that has no antiprism, answering a question posed by Bernt Lindst\"om. As a consequence, any realization of this combinatorial polytope has a face that it cannot rest upon without…

Metric Geometry · Mathematics 2015-06-23 Michael Gene Dobbins

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

Combinatorics · Mathematics 2012-11-02 Edward D. Kim

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

Combinatorics · Mathematics 2025-05-01 Aki Mori , Kenta Mori , Hidefumi Ohsugi

The construction of an unbounded polyhedron from a "jagged'' convex cap is described, and several of its properties discussed, including its relation to Alexandrov's "limit angle."

Computational Geometry · Computer Science 2020-02-18 Joseph O'Rourke

An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…

Discrete Mathematics · Computer Science 2010-08-17 Bill Rosgen , Lorna Stewart

A "hidden symmetry" of a Riemannian manifold M is an isometry of a d-sheeted, 1<d<\infty, Riemannian cover of M which is not the lift of any isometry. In this paper we characterize the locally symmetric metric(s) on a closed, arithmetic…

Differential Geometry · Mathematics 2007-05-23 Benson Farb , Shmuel Weinberger

The higher order supersymmetric partners of a stationary periodic potential are studied. The transformation functions associated to the band edges do not change the spectral structure. However, when the transformation is implemented for…

Quantum Physics · Physics 2007-05-23 David J. Fernandez C

We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axis-aligned squares in $\mathbb{R}^2$ while preserving its structure. We found a counterexample to the conjecture of J. Klawitter, M.…

Computational Geometry · Computer Science 2016-11-24 Matěj Konečný , Stanislav Kučera , Michal Opler , Jakub Sosnovec , Štěpán Šimsa , Martin Töpfer

We briefly review the overlap formalism for chiral gauge theories, the overlap Dirac operator for massless fermions and its connection to domain wall fermions. We describe properties of the overlap Dirac operator, and methods to implement…

High Energy Physics - Lattice · Physics 2007-05-23 Robert G. Edwards , Urs M. Heller , Joe Kiskis , Rajamani Narayanan

Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…

Machine Learning · Statistics 2021-01-06 Patrick Rubin-Delanchy

A nonlinear flag is a finite sequence of nested closed submanifolds. We study the geometry of Frechet manifolds of nonlinear flags, in this way generalizing the nonlinear Grassmannians. As an application we describe a class of coadjoint…

Differential Geometry · Mathematics 2021-09-06 Stefan Haller , Cornelia Vizman

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…

Data Structures and Algorithms · Computer Science 2017-06-21 Michael Jünger , Petra Mutzel , Christiane Spisla

The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…

Mathematical Physics · Physics 2021-10-01 Rutwig Campoamor-Stursberg , Ian Marquette

Let $X$ be a two-sided subshift on a finite alphabet endowed with a mixing probability measure which is positive on all cylinders in $X$. We show that there exist arbitrarily small finite overlapping union of shifted cylinders which…

Dynamical Systems · Mathematics 2018-09-12 Kevin G. Hare , Nikita Sidorov

We give an elementary proof of the fact that any orientable 3-manifold admits a framing (i.e. is parallelizable) and any non-orientable 3-manifold admits a projective framing. The proof uses only basic facts about immersions of surfaces in…

Geometric Topology · Mathematics 2007-05-23 Tahl Nowik

A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of…

Data Structures and Algorithms · Computer Science 2023-08-31 Walter Didimo , Fedor V. Fomin , Petr A. Golovach , Tanmay Inamdar , Stephen Kobourov , Marie Diana Sieper

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…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos
‹ Prev 1 3 4 5 6 7 10 Next ›