English
Related papers

Related papers: Recovering Lexicographic Triangulations

200 papers

For a representation of a finite group $G$ on a complex vector space $V$ we determine when a holomorphic $\binom{p}{q}$-tensor field on the principle stratum of the orbit space $V/G$ can be lifted to a holomorphic $G$-invariant tensor field…

Differential Geometry · Mathematics 2007-05-23 Andreas Kriegl , Mark Losik , Peter W. Michor

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

Geometric Topology · Mathematics 2015-06-02 Basudeb Datta

In this paper, we propose new randomization based algorithms for large scale linear discrete ill-posed problems with general-form regularization: ${\min} \|Lx\|$ subject to ${\min} \|Ax - b\|$, where $L$ is a regularization matrix. Our…

Numerical Analysis · Mathematics 2019-09-24 Zhongxiao Jia , Yanfei Yang

We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…

Analysis of PDEs · Mathematics 2022-09-30 Pablo Angulo , Carlos García-Gutiérrez

We investigate how next-token prediction (NTP) optimization leads language models to extract and organize semantic structure from text. Our analysis, based on a tractable mathematical model and controlled synthetic data, reveals that NTP…

Computation and Language · Computer Science 2025-10-09 Yize Zhao , Christos Thrampoulidis

We study the simplicial volume of manifolds obtained from Davis' reflection group trick, the goal being characterizing those having positive simplicial volume. In particular, we focus on checking whether manifolds in this class with nonzero…

Geometric Topology · Mathematics 2024-09-16 Francesco Milizia

As set systems, hypergraphs are omnipresent and have various representations ranging from Euler and Venn diagrams to contact representations. In a geometric representation of a hypergraph $H=(V,E)$, each vertex $v\in V$ is associated with a…

Computational Geometry · Computer Science 2023-08-21 Daniel Bertschinger , Nicolas El Maalouly , Linda Kleist , Tillmann Miltzow , Simon Weber

This paper introduces the functional tensor singular value decomposition (FTSVD), a novel dimension reduction framework for tensors with one functional mode and several tabular modes. The problem is motivated by high-order longitudinal data…

Methodology · Statistics 2023-10-27 Rungang Han , Pixu Shi , Anru R. Zhang

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…

Machine Learning · Computer Science 2020-03-17 Huyan Huang , Yipeng Liu , Ce Zhu

David Gabai showed that disk decomposable knot and link complements carry taut foliations of depth one. In an arbitrary sutured 3-manifold M, such foliations F, if they exist at all, are determined up to isotopy by an associated ray [F]…

Geometric Topology · Mathematics 2009-09-25 John Cantwell , Lawrence Conlon

We conjecture that for a strongly minimal theory T in a finite signature satisfying the Zilber Trichotomy, there are only three possibilities for the recursive spectrum of T: all countable models of T are recursively presentable; none of…

Logic · Mathematics 2012-06-19 Uri Andrews , Alice Medvedev

Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…

Computational Geometry · Computer Science 2017-11-21 Oswin Aichholzer , Wolfgang Mulzer , Alexander Pilz

We develop a theory of Hrushovski-Kazhdan style motivic integration for certain type of non-archimedean o-minimal fields, namely polynomial-bounded T-convex valued fields. The structure of valued fields is expressed through a two-sorted…

Logic · Mathematics 2013-07-02 Yimu Yin

We consider a class of nonconvex nonsmooth multicomposite optimization problems where the objective function consists of a Tikhonov regularizer and a composition of multiple nonconvex nonsmooth component functions. Such optimization…

Optimization and Control · Mathematics 2026-03-13 Lingzi Jin , Xiao Wang , Xiaojun Chen

Let G be a reductive connected group over an algebraic closure of a finite field. I define a tensor structure on the category of perverse sheaves on G which are direct sums of unipotent character sheaves in a fixed two-sided cell, in…

Representation Theory · Mathematics 2014-02-18 G. Lusztig

We prove the global triangulation conjecture for families of refined p-adic representations under a mild condition. That is, for a refined family, the associated family of (phi, Gamma)-modules admits a global triangulation on a Zariski open…

Number Theory · Mathematics 2016-02-29 Ruochuan Liu

In this paper, we propose a novel variational model for decomposing images into their respective cartoon and texture parts. Our model characterizes certain non-local features of any Bounded Variation (BV) image by its Total Symmetric…

Computer Vision and Pattern Recognition · Computer Science 2025-03-31 Roy Y. He , Martin Huska , Hao Liu

In this paper we introduce the notion of second-order total generalized variation (TGV) regularization for manifold-valued data in a discrete setting. We provide an axiomatic approach to formalize reasonable generalizations of TGV to the…

Numerical Analysis · Mathematics 2018-09-17 K. Bredies , M. Holler , M. Storath , A. Weinmann

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…

Combinatorics · Mathematics 2025-08-19 David Garber , Chaya Keller , Olga Nissenbaum , Shimon Aviram
‹ Prev 1 8 9 10 Next ›