English
Related papers

Related papers: Cubical convex ear decompositions

200 papers

Coordinate compounds (CCs) and elaborate expressions (EEs) are coordinate constructions common in languages of East and Southeast Asia. Mortensen (2006) claims that (1) the linear ordering of EEs and CCs in Hmong, Lahu, and Chinese can be…

Computation and Language · Computer Science 2022-07-05 Chenxuan Cui , Katherine J. Zhang , David R. Mortensen

Disclinations are ubiquitous lattice defects existing in almost all crystalline materials. In two-dimensional nanomaterials, disclinations lead to the warping and deformation of the hosting material, yielding non-Euclidean geometries.…

Mesoscale and Nanoscale Physics · Physics 2022-01-26 Ying Chen , Yuhang Yin , Ze-Huan Zheng , Yang Liu , Zhi-Kang Lin , Jing Li , Jian-Hua Jiang , Huanyang Chen

In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…

Optimization and Control · Mathematics 2013-02-05 James Saunderson , Venkat Chandrasekaran , Pablo A. Parrilo , Alan S. Willsky

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

We propose a novel variant of the Localized Orthogonal Decomposition (LOD) method for time-harmonic scattering problems of Helmholtz type with high wavenumber $\kappa$. On a coarse mesh of width $H$, the proposed method identifies local…

Numerical Analysis · Mathematics 2024-08-05 Philip Freese , Moritz Hauck , Daniel Peterseim

Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a…

Combinatorics · Mathematics 2012-04-03 Russ Woodroofe

We prove that p.q.-Baer *-ring forms a pseudo lattice with Conrads partial order and also characterize p.q.-Baer *-rings which are lattices. The initial segments of a p.q.-Baer *-ring with Conrads partial order are shown to be orthomodular…

Combinatorics · Mathematics 2016-12-06 Anil Khairnar , B. N. Waphare

This paper is devoted to the classification problems concerning extended deformations of convex polyhedra and real hyperplane arrangements in the following senses: combinatorial equivalence of face posets, normal equivalence on normal fans…

Combinatorics · Mathematics 2024-08-08 Houshan Fu , Boxuan Li , Chunming Tang , Suijie Wang

Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…

Optimization and Control · Mathematics 2014-10-14 Julián Romero , Mauricio Velasco

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…

Rings and Algebras · Mathematics 2019-05-24 Ivan Chajda , Helmut Länger , Jan Paseka

Co-clustering exploits the duality of instances and features to simultaneously uncover meaningful groups in both dimensions, often outperforming traditional clustering in high-dimensional or sparse data settings. Although recent deep…

Machine Learning · Computer Science 2025-04-10 Ashwin Vinod , Chandrajit Bajaj

Anders Bjorner characterized which finite graded partially ordered sets arise as the posets of closure relations on cells of a finite, regular CW complex. His characterization of these "CW posets" required each open interval $(\hat{0},u)$…

Combinatorics · Mathematics 2014-11-06 Patricia Hersh

We derive a posteriori error estimates for a semi-discrete finite element approximation of a nonlinear eddy current problem arising from applied superconductivity, known as the $p$-curl problem. In particular, we show the reliability for…

Numerical Analysis · Mathematics 2020-02-11 Andy T. S. Wan , Marc Laforest

We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…

Combinatorics · Mathematics 2022-04-11 Camille Combe , Samuele Giraudo

In this article, we propose a non-parametric Bayesian level-set method for simultaneous reconstruction of two different piecewise constant coefficients in an elliptic partial differential equation. We show that the Bayesian formulation of…

Applications · Statistics 2025-05-28 Anuj Abhishek , Thilo Strauss , Taufiquar Khan

The practice of compressed sensing suffers importantly in terms of the efficiency/accuracy trade-off when acquiring noisy signals prior to measurement. It is rather common to find results treating the noise affecting the measurements,…

Numerical Analysis · Mathematics 2014-11-25 Marco Artina , Massimo Fornasier , Steffen Peter

The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…

Algebraic Topology · Mathematics 2020-04-23 Manuel Norman

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen