Related papers: Interval-Dismantling for Lattices
Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…
This work introduces a novel principle for disentanglement we call mechanism sparsity regularization, which applies when the latent factors of interest depend sparsely on observed auxiliary variables and/or past latent factors. We propose a…
We develop a hierarchy of semilattice bases (S-bases) for frames. For a given (unbounded) meet-semilattice $A$, we analyze the interval in the coframe of sublocales of the frame of downsets of $A$ formed by all frames with the S-base $A$.…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
Architected materials can exhibit remarkable combinations of stiffness, strength, and toughness, yet their application is currently limited by an incomplete understanding of how cracks initiate and propagate through their discrete…
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…
In the framework of perturbation theory, it is possible to put chiral gauge theories on the lattice without violating the gauge symmetry or other fundamental principles, provided the fermion representation of the gauge group is…
We develop a method that we call \emph{omission of intervals}, for establishing topological properties of subsets of the real line based on their combinatorial structure. Using this method, we obtain conceptual proofs of the fundamental…
Recently $C^m$-conforming finite elements on simplexes in arbitrary dimension are constructed by Hu, Lin and Wu. The key in the construction is a non-overlapping decomposition of the simplicial lattice in which each component will be used…
Disentangled representations seek to recover latent factors of variation underlying observed data, yet their identifiability is still not fully understood. We introduce a unified framework in which disentanglement is achieved through…
We introduce the first metric for evaluating disentanglement at individual hierarchy levels of a structured latent representation. Applied to object-centric generative models, this offers a systematic, unified approach to evaluating (i)…
Several variants of the recently proposed Density Matrix Embedding Theory (DMET) [G. Knizia and G. K-L. Chan, Phys. Rev. Lett. 109, 186404 (2012)] are formulated and tested. We show that spin symmetry breaking of the lattice mean-field…
Attribute and size reductions are key issues in formal concept analysis. In this paper, we consider a special kind of equivalence relation to reduce concept lattices, which will be called local congruence. This equivalence relation is based…
This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…
Correlations between factors of variation are prevalent in real-world data. Exploiting such correlations may increase predictive performance on noisy data; however, often correlations are not robust (e.g., they may change between domains,…
We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
We clarify the lore that anomaly-free symmetries are either on-site or can be transformed into on-site symmetries. We prove that any finite, internal, anomaly-free symmetry in a 1+1d lattice Hamiltonian system can be disentangled into an…
In this work, we begin the study of a new class of dynamical systems determined by interval maps generated by the symbolic action of erasing substitution rules. We do this by discussing in some detail the geometric, analytical, dynamical…
Network dismantling aims at breaking a network into disconnected components, and attacking vertices that intersect with many loops has proven to be a most efficient strategy. But the existing loop-focusing methods treat the short loops…