Results 11 to 20 of about 6,993 (154)
Incidence combinatorics of resolutions
We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of subspace ...
Dmitry, Eva-maria Feichtner, N. Kozlov
core +4 more sources
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics [PDF]
Abstract Multiple sequence alignment is one of the dominant problems in computational molecular biology. Numerous scoring functions and methods have been proposed, most of which result in NP-hard problems. In this paper we propose for the first time a general formulation for multiple alignment with arbitrary gap-costs based on an integer
Althaus, E. +3 more
openaire +3 more sources
Canonical forms of oriented matroids
Abstract Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full‐dimensional projective polytope is a positive geometry. Motivated by the canonical forms of polytopes, we construct a canonical form for any tope of an oriented matroid inside the Orlik–
Christopher Eur, Thomas Lam
wiley +1 more source
Geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction.
Drellich, Elizabeth +5 more
core +1 more source
Moments, sums of squares, and tropicalization
Abstract We use tropicalization to study the duals to cones of nonnegative polynomials and sums of squares on a semialgebraic set S$S$. The truncated cones of moments of measures supported on the set S$S$ are dual to nonnegative polynomials on S$S$, while “pseudomoments” are dual to sums of squares approximations to nonnegative polynomials.
Grigoriy Blekherman +4 more
wiley +1 more source
Generalized angle vectors, geometric lattices, and flag-angles
Interior and exterior angle vectors of polytopes capture curvature information at faces of all dimensions and can be seen as metric variants of $f$-vectors.
Backman, Spencer +2 more
core
Two series of polyhedral fundamental domains for Lorentz bi-quotients [PDF]
The main aim of this paper is to give two infinite series of examples of Lorentz space forms that can be obtained from Lorentz polyhedra by identification of faces.
Pratoussevitch, Anna, Turki, Nasser Bin
core +2 more sources
Geometric inequalities, stability results and Kendall's problem in spherical space
Abstract In Euclidean space, the asymptotic shape of large cells in various types of Poisson‐driven random tessellations has been the subject of a famous conjecture due to David Kendall. Since shape is a geometric concept and large cells are identified by means of geometric size functionals, the resolution of the conjecture is inevitably connected with
Daniel Hug, Andreas Reichenbacher
wiley +1 more source
For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail.
Bakuradze, M. +2 more
core +1 more source
On Generalized Avicenna Numbers
ABSTRACT Avicenna numbers that we define in this paper, are a class of figurate numbers, including icosahedral, octahedral, tetrahedral, dodecahedral, rhombicosidodecahedral numbers and cubes, play a key role in mathematics, physics and various scientific fields.
Melih Göcen, Yüksel Soykan
wiley +1 more source

