Related papers: Cut and project sets with polytopal window II: lin…
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…
In this work, we study a novel class of projection-based algorithms for linearly constrained problems (LCPs) which have a lot of applications in statistics, optimization, and machine learning. Conventional primal gradient-based methods for…
The goal of this paper is to derive new classes of valid convex inequalities for quadratically constrained quadratic programs (QCQPs) through the technique of lifting. Our first main result shows that, for sets described by one bipartite…
In this paper, we focus on two classes of D-invariant polynomial subspaces. The first is a classical type, while the second is a new class. With matrix computation, we prove that every ideal projector with each D-invariant subspace…
Deep learning has shown state-of-art classification performance on datasets such as ImageNet, which contain a single object in each image. However, multi-object classification is far more challenging. We present a unified framework which…
Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible…
Disjointness, bands, and band projections are a classical and essential part of the structure theory of vector lattices. If $X$ is such a lattice, those notions seem - at first glance - intimately related to the lattice operations on $X$.…
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…
Many statistical problems involve the estimation of a $\left(d\times d\right)$ orthogonal matrix $\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\textbf{Q}$. To cope with this problem, we…
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…
Standard vision models treat objects as independent points in Euclidean space, unable to capture hierarchical structure like parts within wholes. We introduce Worldline Slot Attention, which models objects as persistent trajectories through…
In this paper, we extend the popular dictionary pair learning (DPL) into the scenario of twin-projective latent flexible DPL under a structured twin-incoherence. Technically, a novel framework called Twin-Projective Latent Flexible DPL…
Structure optimization, which yields the relaxed structure (minimum-energy state), is essential for reliable materials property calculations, yet traditional ab initio approaches such as density-functional theory (DFT) are computationally…
We prove that if X is any 2-regular projective scheme (in the sense of Castelnuovo-Mumford) then X is "small". This means that if L is a linear space and Y:= L\cap X is finite, then Y is "linearly independent" in the sense that the…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…
In a space-time, a conformal structure is defined by the distribution of light-cones. Geodesics are traced by freely falling particles, and the collection of all unparameterized geodesics determines the projective structure of the…
We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…