Related papers: Interval-Dismantling for Lattices
We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, and derive a canonical representation. Moreover, we prove said scale-measures are lattice…
We introduce a new general identifiable framework for principled disentanglement referred to as Structured Nonlinear Independent Component Analysis (SNICA). Our contribution is to extend the identifiability theory of deep generative models…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
The set of space-time short-distance structures which can be described through linear operators is limited to a few basic cases. These are continua, lattices and a further short-distance structure which implies an ultraviolet cut-off. Under…
Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…
We study several numerical discretization techniques for the one-space plus one-time dimensional Dirac equation, including finite difference and space-time finite element methods. Two finite difference schemes and several space-time finite…
Consequences of different discretizations of the two-dimensional Dirac operator on low energy properties (e.g., the number of nodes) and their relations to gauge properties are discussed. Breaking of the gauge invariance was suggested in a…
I give a review of existing frameworks, which are designed to analyse lattice data in the three-particle sector. A particular emphasis is laid on the foundations of the theory, where the separation of the short- and long-range effects plays…
Spatial reasoning over text is challenging as the models not only need to extract the direct spatial information from the text but also reason over those and infer implicit spatial relations. Recent studies highlight the struggles even…
In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
We study dissipative dynamics constructed by means of non-commutative Dirichlet forms for various lattice systems with multiparticle interactions associated to CCR algebras. We give a number of explicit examples of such models. Using an…
The anomaly cancellation is at the basis of the perturbative consistence of the Standard Model and it provides a partial explanation of charge quantization. We consider an effective Electroweak theory on a lattice, with a quartic…
Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…
We study the network dismantling problem, which consists in determining a minimal set of vertices whose removal leaves the network broken into connected components of sub-extensive size. For a large class of random graphs, this problem is…
We propose a Hamiltonian framework for constructing chiral gauge theories on the lattice based on symmetry disentanglers: constant-depth circuits of local unitaries that transform not-on-site symmetries into on-site ones. When chiral…
Extreme localization of damage in conventional brittle materials is the source of a host of undesirable effects. We show how artificially engineered metamaterials with all brittle constituents can be designed to ensure that every breakable…
Explainable AI aims to overcome the black-box nature of complex ML models like neural networks by generating explanations for their predictions. Explanations often take the form of a heatmap identifying input features (e.g. pixels) that are…
When modelling discontinuities (interfaces) using the finite element method, the standard approach is to use a conforming finite-element mesh in which the mesh matches the interfaces. However, this approach can prove cumbersome if the…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…