Related papers: Optimal Triangulation of Regular Simplicial Sets

In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such that the intersection of every subcollection is either empty or…

Suppose $K$ is a knot in a closed 3-manifold $M$ such that $\bar{M-N(K)}$ is irreducible. We show that for any positive integer $b$ there exists a triangulation of $\bar{M-N(K)}$ such that any weakly incompressible bridge surface for $K$ of…

In this note, we extend earlier work by showing that if $X$ and $Y$ are delta-complexes (i.e. simplicial sets without degeneracy operators), a morphism $g:N(X)\to N(Y)$ of Steenrod coalgebras (normalized chain-complexes equipped with extra…

Neurons in the brain are often finely tuned for specific task variables. Moreover, such disentangled representations are highly sought after in machine learning. Here we mathematically prove that simple biological constraints on neurons,…

We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…

The aim of this paper is twofold. First, we show that a certain concatenation of a proximity operator with an affine operator is again a proximity operator on a suitable Hilbert space. Second, we use our findings to establish so-called…

Human decision-making is sequential and uncertainty-aware, yet standard neural networks often rely on static, dense forward computation with limited visibility into evidence acquisition, uncertainty evolution, or when computation should…

Batch Normalization (BN) has become a cornerstone of deep learning across diverse architectures, appearing to help optimization as well as generalization. While the idea makes intuitive sense, theoretical analysis of its effectiveness has…

Linear representation learning is widely studied due to its conceptual simplicity and empirical utility in tasks such as compression, classification, and feature extraction. Given a set of points $[\mathbf{x}_1, \mathbf{x}_2, \ldots,…

Perhaps the simplest IR renormalon occurs in the ground state energy of a superrenormalizable model, the scalar $O(N)$ theory in two dimensions with a quartic potential and negative squared mass. We show that this renormalon, found…

By using only combinatorial data on two posets X and Y, we construct a set of so-called formulas. A formula produces simultaneously, for any abelian category A, a functor between the categories of complexes of diagrams over X and Y with…

A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…

An enumerative theory of triangulations of simplicial complexes has been developed by Stanley. A key role in his theory is played by the local $h$-polynomial of a triangulation of a simplex. This paper develops a parallel theory, in which…

By a $B$-regular variety, we mean a smooth projective variety over $C$ admitting an algebraic action of the upper triangular Borel subgroup $B \subset SL_2(C)$ such that the unipotent radical in $B$ has a unique fixed point. A result of M.…

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

We investigate an alternative solution method to the joint signal-beamformer optimization problem considered by Setlur and Rangaswamy[1]. First, we directly demonstrate that the problem, which minimizes the received noise, interference, and…

This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…