Related papers: Cut and project sets with polytopal window II: lin…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…
A new predictor-corrector type incremental algorithm is proposed for the exact construction of weighted straight skeletons of 2D general planar polygons of arbitrary complexity based on the notion of deforming polygon. In the proposed…
We give elementary proof of stronger versions of several recent results on intrinsic Diophantine approximation on rational quadric hypersurfaces $X\subset \mathbb{P}^n(\mathbb{R})$. The main tool is a refinement of the simplex lemma, which…
Identifying latent state representations and dynamics is essential when direct modeling in observation space is infeasible, particularly under partial and high-dimensional observations. In such settings, representation learning and…
Integrating hard constraints into deep learning is essential for safety-critical systems. Yet existing constructive layers that project predictions onto constraint boundaries face a fundamental bottleneck: gradient saturation. By collapsing…
We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and…
Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying an algebraic…
We study symplectic and projective structures on small covers over products of polygons. We introduce the factor-compatible class for small covers over products of polygons and prove that every factor-compatible small cover admits a smooth…
We investigate the iterative construction of discrete Laplacians on 2D square lattices, revealing emergent fractal-like patterns shaped by modular arithmetic. While classical 2222-style iterations reproduce known structures such as the…
There is a hierarchy of structure conditions for convex sets. In this paper we study a recently defined [3, 8, 9] condition called locally nonconical convexity (abbreviated LNC). Is is easy to show that every strictly convex set is LNC, as…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
Lattice simulations can play an important role in the study of dynamical electroweak symmetry breaking by providing quantitative results on the nonperturbative dynamics of candidate theories. For this programme to succeed, it is crucial to…
Fracton order is a new kind of quantum order characterized by topological excitations that exhibit remarkable mobility restrictions and a robust ground state degeneracy (GSD) which can increase exponentially with system size. In this paper,…
We consider the conjecture that all artinian height 4 complete intersections of forms of the same degree $d$ have the Weak Lefschetz Property (WLP). We translate this problem to one of studying the general hyperplane section of a certain…
As the first part of the treatise on A General Theory of Concept Lattice (I-V), this work develops the general concept lattice for the problem concerning categorization of objects according to their properties. Unlike the conventional…
Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…
The disjunctive system is a system involving a disjunctive set which is the union of finitely many polyhedral convex sets. In this paper, we introduce a notion of the relaxed constant positive linear dependence constraint qualification…
Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…
We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…
The purpose of this article is to study directed collapsibility of directed Euclidean cubical complexes. One application of this is in the nontrivial task of verifying the execution of concurrent programs. The classical definition of…