Canonical Dual Research Articles

Quantum spin systems: Toroidal classification and geometric duality

We demonstrate a toroidal classification for quantum spin systems, revealing an intrinsic geometric duality within this structure. Through our classification and duality, we reveal that various bipartite quantum features in magnon systems can manifest equivalently in both bipartite ferromagnetic and antiferromagnetic materials, based upon the availability of relevant Hamiltonian parameters. Additionally, the results highlight the antiferromagnetic regime as an ultrafast dual counterpart to the ferromagnetic regime, both exhibiting identical capabilities for quantum spintronics and technological applications. Concrete illustrations are provided, demonstrating how splitting and squeezing types of two-mode magnon quantum correlations can be realized across ferro- and antiferromagnetic regimes. Published by the American Physical Society 2024

An unbounded operator theory approach to lower frame and Riesz-Fischer sequences

Frames and orthonormal bases are important concepts in functional analysis and linear algebra. They are naturally linked to bounded operators. To describe unbounded operators those sequences might not be well suited. This has already been noted by von Neumann in the 1920ies. But modern frame theory also investigates other sequences, including those that are not naturally linked to bounded operators. The focus of this manuscript will be two such kind of sequences: lower frame and Riesz-Fischer sequences. We will discuss the inter-relation of those sequences. We will fill a hole existing in the literature regarding the classification of these sequences by their synthesis operator. We will use the idea of generalized frame operator and Gram matrix and extend it. We will use that to show properties for canonical duals for lower frame sequences, such as a minimality condition regarding its coefficients. We will also show that other results that are known for frames can be generalized to lower frame sequences. Finally, we show that the converse of a well-known result is true, i.e. that minimal lower frame sequences are equivalent to complete Riesz-Fischer sequences, without any further assumptions.To be able to tackle these tasks, we had to revisit the concept of invertibility (in particular for non-closed operators). In addition, we are able to define a particular adjoint, which is uniquely defined for any operator.

An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems

In this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices) as well as the facets of the Edgeworth–Pareto hull. We note that these extreme points are the extreme supported non-dominated points of a MOMILP. We also show how to extend the concept of geometric duality for multi-objective linear programming problems to the Edgeworth–Pareto hull of MOMILPs and use this extension to develop the algorithm. The algorithm relies on a novel oracle that solves single-objective weighted-sum problems and we show that the required number of oracle calls is polynomial in the number of facets of the convex hull of the extreme supported non-dominated points in the case of MOMILPs. Thus, for MOMILPs for which the weighted-sum problem is solvable in polynomial time, the facets can be computed with incremental-polynomial delay—a result that was formerly only known for the computation of extreme supported non-dominated points. Our algorithm can be an attractive option to compute lower bound sets within multi-objective branch-and-bound algorithms for solving MOMILPs. This is for several reasons as (i) the algorithm starts from a trivial valid lower bound set then iteratively improves it, thus at any iteration of the algorithm a lower bound set is available; (ii) the algorithm also produces efficient solutions (i.e., solutions in the decision space); (iii) in any iteration of the algorithm, a relaxation of the MOMILP can be solved, and the obtained points and facets still provide a valid lower bound set. Moreover, for the special case of multi-objective linear programming problems, the algorithm solves the problem to global optimality. A computational study on a set of benchmark instances from the literature is provided.

Predicting Binding Energies and Electronic Properties of Boron Nitride Fullerenes Using a Graph Convolutional Network.

As isoelectronic counterparts of carbon fullerenes, medium-sized boron nitride clusters also prefer cage structures composed of even-sized polygons. As the cluster size increases, the number of cage isomers grows rapidly, and determining the ground state structure requires a tremendous amount of DFT calculations. Herein, we develop a graph convolutional network (GCN) that can describe the energy of a (BN)n cage by its topology connection. We define a vertex feature vector on a dual polyhedron by the permutation of the neighbor vertices' degree and aggregate the information on vertices by two graph convolutional layers to learn the local feature of the dual polyhedron. The GCN is trained on (BN)28 and subsequently tested on (BN)23 and (BN)24 data sets, which satisfactorily reproduce the order of isomer energies from DFT calculations. We further employ the trained GCN to predict the ground state structures within the size range of n = 25-32, which agree well with DFT results. Using the same GCN framework, we also successfully trained the highest-occupied or lowest-unoccupied orbital energies of (BN)28 isomers. The present graph convolutional network establishes a direct mapping between the topological connection and the energetic or electronic properties of a cage-like cluster or molecule.

A digital geometry on the tetrakis square tiling—Distance and coarsening

AbstractThere are various tessellations of the plane, including three regular and eight semi‐regular tilings. The square grid is self‐dual, and the hexagonal and triangular tilings are dual to each other. The semi‐regular tessellations are based on more than one type of regular tiles, while their dual tilings are based on a sole but not a regular tile. In various applications, including Geographical Information Systems, it is worth considering non‐regular grids instead of the most used square grid. In this article, we are interested in the dual of the semi‐regular truncated quadrille tiling, T(8,8,4), which is also known as the Khalimsky grid due to its connectedness structure. In our grid, which is called the tetrakis square or kisquadrille tiling, while it is denoted by D(8,8,4), we consider the right‐angled triangle regions of the usual two‐dimensional Khalimsky graph as tiles/pixels. We give an easy‐to‐use coordinate frame addressing the triangles of all the four different orientations. Neighbor relations are described mathematically based on this frame. Based on the shortest path algorithm, a closed formula is proven to compute the digital, that is, path‐based distance on this grid. Some properties of the distance function have also been studied. Hierarchical coarsening is a frequently used technique both in Geometric and Geographical Information Systems to rescale some parts of the map. The tetrakis square grid is apt for hierarchical coarsening, and thus, it can easily be used in image compression and multigrid and other related methods.

Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems

We study geometric duality for convex vector optimization problems. For a primal problem with a -dimensional objective space, we formulate a dual problem with a -dimensional objective space. Consequently, different from an existing approach, the geometric dual problem does not depend on a fixed direction parameter, and the resulting dual image is a convex cone. We prove a one-to-one correspondence between certain faces of the primal and dual images. In addition, we show that a polyhedral approximation for one image gives rise to a polyhedral approximation for the other. Based on this, we propose a geometric dual algorithm which solves the primal and dual problems simultaneously and is free of direction-biasedness. We also modify an existing direction-free primal algorithm in such a way that it solves the dual problem as well. We test the performance of the algorithms for randomly generated problem instances by using the so-called primal error and hypervolume indicator as performance measures.

A note on geometric duality in matroid theory and knot theory

We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of checkerboard graphs is the same as the equivalence relation defined by 2-isomorphisms of checkerboard graphs.

Reflexivity of Newton–Okounkov bodies of partial flag varieties

Assume that the valuation semigroup Γ ( λ ) \Gamma (\lambda ) of an arbitrary partial flag variety corresponding to the line bundle L λ \mathcal {L_\lambda } constructed via a full-rank valuation is finitely generated and saturated. We use Ehrhart theory to prove that the associated Newton–Okounkov body — which happens to be a rational, convex polytope — contains exactly one lattice point in its interior if and only if L λ \mathcal {L}_\lambda is the anticanonical line bundle. Furthermore, we use this unique lattice point to construct the dual polytope of the Newton–Okounkov body and prove that this dual is a lattice polytope using a result by Hibi. This leads to an unexpected, necessary and sufficient condition for the Newton–Okounkov body to be reflexive.

Fano 3-folds, reflexive polytopes and brane brick models

Reflexive polytopes in n dimensions have attracted much attention both in mathematics and theoretical physics due to their connection to Fano n-folds and mirror symmetry. This work focuses on the 18 regular reflexive polytopes corresponding to smooth Fano 3-folds. For the first time, we show that all 18 regular reflexive polytopes have corresponding 2d (0, 2) gauge theories realized by brane brick models. These 2d gauge theories can be considered as the worldvolume theories of D1-branes probing the toric Calabi-Yau 4-singularities whose toric diagrams are given by the associated regular reflexive polytopes. The generators of the mesonic moduli space of the brane brick models are shown to form a lattice of generators due to the charges under the rank 3 mesonic flavor symmetry. It is shown that the lattice of generators is the exact polar dual reflexive polytope to the corresponding toric diagram of the brane brick model. This duality not only highlights the close relationship between the geometry and 2d gauge theory, but also opens up pathways towards new discoveries in relation to reflexive polytopes and brane brick models.

Substitution Discrete Plane Tilings with 2n-Fold Rotational Symmetry for Odd n

We study substitution tilings that are also discrete plane tilings, that is, satisfy a relaxed version of cut-and-projection. We prove that the Sub Rosa substitution tilings with a 2n-fold rotational symmetry for odd \(n>5\) defined by Kari and Rissanen are not discrete planes—and therefore not cut-and-project tilings either. We then define new Planar Rosa substitution tilings with a 2n-fold rotational symmetry for any odd n, and show that these satisfy the discrete plane condition. The tilings we consider are edge-to-edge rhombus tilings. We give an explicit construction for the 10-fold case, and provide a construction method for the general case of any odd n. Our methods are to lift the tilings and substitutions to \({\mathbb {R}}^{{n}}\) using the lift operator first defined by Levitov, and to study the planarity of substitution tilings in \({\mathbb {R}}^{{n}}\) using mainly linear algebra, properties of circulant matrices, and trigonometric sums. For the construction of the Planar Rosa substitutions we additionally use the Kenyon criterion and a result on De Bruijn multigrid dual tilings.

Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems

We explore the Projective Cutting-Planes algorithm proposed in Porumbel (2020) from new angles by applying it to two new problems, that is, to robust linear programming and to a cutting-stock problem with multiple lengths. Projective Cutting-Planes is a generalization of the widely used Cutting-Planes, and it aims at optimizing a linear function over a polytope [Formula: see text] with prohibitively many constraints. The main new idea is to replace the well-known separation subproblem with the following projection subproblem: given an interior point [Formula: see text] and a direction [Formula: see text], find the maximum steplength t such that [Formula: see text]. This enables one to generate a feasible solution at each iteration, a feature that does not exist built-in in a standard Cutting-Planes algorithm. The practical success of this new algorithm does not mainly come from the higher level ideas already presented in Porumbel (2020) . Its success is significantly more dependent on the computation time needed to solve the projection subproblem in practice. Thus, the main challenge addressed by the current paper is the design of new techniques for solving this subproblem very efficiently for different polytopes [Formula: see text]. We first address a well-known robust linear programming problem in which [Formula: see text] is defined as a primal polytope. We then solve a multiple-length cutting stock problem in which [Formula: see text] is a dual polytope defined in a column generation model. Numerical experiments on both these new problems confirm the potential of the proposed ideas. This enables us to draw conclusions supported by numerical results from both the current paper and Porumbel (2020) while also gaining more insight into the dynamics of the algorithm. Summary of Contribution: The well-known Cutting-Planes algorithm relies on the separation subproblem to cut off the current optimal solution. This paper belongs to a line of work whose goal is to “upgrade” the widely used separation subproblem to the following projection subproblem: given a feasible solution x inside some polytope P and a direction d, what is the maximum t value such that x + td ∈ P. In simple terms, one has to “shoot” from x along direction d up to the point where the boundary of the polytope is hit. The greatest challenge is to solve this projection subproblem rapidly enough to compete well in terms of computational speed with the separation subproblem algorithm. This paper shows how to achieve this on two new problems: robust linear programming and multiple length cutting stock. The numerical results confirm one important advantage offered by the projection logic: it enables one to generate a new feasible interior solution (i.e., x + td) at each iteration. The interior points thus generated actually guide the evolution of the overall algorithm, which is a feature that does not exist (built-in) in a traditional Cutting-Planes algorithm.

Phase transitions of correlations in black hole geometries

We study the holographic realization of optimized correlation measures---measures of quantum correlation that generalize elementary entropic formulas---in two-dimensional thermal states dual to spacetimes with a black hole horizon. We consider the symmetric bipartite optimized correlation measures: the entanglement of purification, Q-correlation, R-correlation, and squashed entanglement, as well as the mutual information, a nonoptimized correlation measure, and identify the bulk surface configurations realizing their geometric duals over the parameter space of boundary region sizes and the black hole radius. This parameter space is divided into phases associated with given topologies for these bulk surface configurations, and first-order phase transitions occur as a new topology of bulk surfaces becomes preferred. The distinct phases can be associated with different degrees of correlation between the boundary regions and the thermal environment. The Q-correlation has the richest behavior, with a structure of nested optimizations leading to two topologically distinct bulk surface configurations being equally valid as geometric duals at generic points in the phase diagram.

Optimal area polygonization problems: Exact solutions through geometric duality

In this paper, we describe exact methods to solve two problems: given a set S of n points in the plane, find a simple polygon whose set of vertices is precisely S and has minimum (Min-Area) or maximum (Max-Area) area. These problems are strongly related to the Euclidean TSP, whilst the goal here is to min/max-imize the finite area bounded by the cycle. Both problems are known to be NP-complete. Previous works focused on heuristic methods, specially in 2019, where considerable attention was given to them due to a worldwide contest that took place as part of the Computational Geometry Week. Moreover, to the best of our knowledge, there is only one work aimed to solve these problems exactly. Our main contributions include a novel Integer Linear Programming (ILP) formulation for these problems, along with preprocessing and formulation strengthening techniques to improve its performance in practice. We conducted an extensive experimental study to assess the effectiveness of our model and its variants, and to compare our results to the literature. With respect to the latter analysis, we achieved a speedup of approximately 11.46 (2.21) on average for Min-Area (Max-Area), when compared to the best known model.

Symmetrized holographic entropy cone

The holographic entropy cone (HEC) characterizes the entanglement structure of quantum states which admit geometric bulk duals in holography. Due to its intrinsic complexity, to date it has only been possible to completely characterize the HEC for at most $n=5$ numbers of parties. For larger $n$, our knowledge of the HEC falls short of incomplete: almost nothing is known about its extremal elements. Here, we introduce a symmetrization procedure that projects the HEC onto a natural lower dimensional subspace. Upon symmetrization, we are able to deduce properties that its extremal structure exhibits for general $n$. Further, by applying this symmetrization to the quantum entropy cone, we are able to quantify the typicality of holographic entropies, which we find to be exponentially rare quantum entropies in the number of parties.

Matroids arising from electrical networks

This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces with boundary. Second, we characterize the Bergman fans of Dirichlet matroids as subfans of graphic Bergman fans. Third, we prove an interlacing result on the real zeros and poles of the trace of the response matrix. And fourth, we bound the coefficients of the precoloring polynomial of a network by the coefficients of the associated chromatic polynomial.

Quantum Extremal Surfaces and the Holographic Entropy Cone

Quantum states with geometric duals are known to satisfy a stricter set of entropy inequalities than those obeyed by general quantum systems. The set of allowed entropies derived using the Ryu-Takayanagi (RT) formula defines the Holographic Entropy Cone (HEC). These inequalities are no longer satisfied once general quantum corrections are included by employing the Quantum Extremal Surface (QES) prescription. Nevertheless, the structure of the QES formula allows for a controlled study of how quantum contributions from bulk entropies interplay with HEC inequalities. In this paper, we initiate an exploration of this problem by relating bulk entropy constraints to boundary entropy inequalities. In particular, we show that requiring the bulk entropies to satisfy the HEC implies that the boundary entropies also satisfy the HEC. Further, we also show that requiring the bulk entropies to obey monogamy of mutual information (MMI) implies the boundary entropies also obey MMI.

The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture

The integer linear programming approach to structural learning of decomposable graphical models led us earlier to the concept of a chordal graph polytope. An open mathematical question motivated by this research is what is the minimal set of linear inequalities defining this polytope, i.e. what are its facet-defining inequalities, and we came up in 2016 with a specific conjecture that it is the collection of so-called clutter inequalities. In this theoretical paper we give an implicit characterization of the minimal set of inequalities. Specifically, we introduce a dual polyhedron (to the chordal graph polytope) defined by trivial equality constraints, simple monotonicity inequalities and certain inequalities assigned to incomplete chordal graphs. Our main result is that the vertices of this polyhedron yield the facet-defining inequalities for the chordal graph polytope. We also show that the original conjecture is equivalent to the condition that all vertices of the dual polyhedron are zero-one vectors. Using that result we disprove the original conjecture: we find a vector in the dual polyhedron which is not in the convex hull of zero-one vectors from the dual polyhedron.

Weaving Frames in Hilbert C ∗ -Modules

In this paper, we investigate weaving frames in Hilbert C ∗ -modules. We show that the equivalence of woven and weakly woven frames is still true for modular frames under certain conditions. By using the analysis operators of frames and frame operators of canonical duals, we obtain several perturbation results for given weaving frames and different weaving frame pairs. When the C ∗ -algebra is nonunital, we derive a correspondence of adjointable operators which is bounded below woven families. Finally, we discuss the redundancy of weaving frames in Hilbert C ∗ -modules.

On symmetry breaking of dual polyhedra of non-crystallographic group H3.

The study of the polyhedra described in this paper is relevant to the icosahedral symmetry in the assembly of various spherical molecules, biomolecules and viruses. A symmetry-breaking mechanism is applied to the family of polytopes {\cal V}_{H_{3}}(\lambda) constructed for each type of dominant point λ. Here a polytope {\cal V}_{H_{3}}(\lambda) is considered as a dual of a {\cal D}_{H_{3}}(\lambda) polytope obtained from the action of the Coxeter group H3 on a single point \lambda\in{\bb R}^{3}. The H3 symmetry is reduced to the symmetry of its two-dimensional subgroups H2, A1 × A1 and A2 that are used to examine the geometric structure of {\cal V}_{H_{3}}(\lambda) polytopes. The latter is presented as a stack of parallel circular/polygonal orbits known as the `pancake' structure of a polytope. Inserting more orbits into an orbit decomposition results in the extension of the {\cal V}_{H_{3}}(\lambda) structure into various nanotubes. Moreover, since a {\cal V}_{H_{3}}(\lambda) polytope may contain the orbits obtained by the action of H3 on the seed points (a, 0, 0), (0, b, 0) and (0, 0, c) within its structure, the stellations of flat-faced {\cal V}_{H_{3}}(\lambda) polytopes are constructed whenever the radii of such orbits are appropriately scaled. Finally, since the fullerene C20 has the dodecahedral structure of {\cal V}_{H_{3}}(a,0,0), the construction of the smallest fullerenes C24, C26, C28, C30 together with the nanotubes C20+6N, C20+10N is presented.

Quantum torsion and a Hartle-Hawking beam

In the Einstein-Cartan framework the torsion-free conditions arise within the Hamiltonian treatment as second-class constraints. The standard strategy is to solve these constraints, eliminating the torsion from the classical theory, before quantization. Here we advocate leaving the torsion inside the other constraints before quantization, leading at first to wave functions that can be called ``kinematical'' with regards to the torsion, but not the other constraints. The torsion-free condition can then be imposed as a condition upon the physical wave packets one constructs, satisfying the usual uncertainty relations, and so with room for quantum fluctuations in the torsion. This alternative strategy has the surprising effect of clarifying the sense in which the wave functions solving an explicitly real theory are ``delta-function normalizable''. Such solutions with zero (or any fixed) torsion, should be interpreted as plane waves in torsion space. Properly constructed wave packets are therefore normalizable in the standard sense. Given that they are canonical duals, this statement applies equally well to the Chern-Simons state (connection representation) and the Hartle-Hawking wave function (metric representation). We show how, when torsion is taken into account, the Hartle-Hawking wave function is replaced by a Gauss-Airy function, with finite norm, which we call the Hartle-Hawking beam. The Chern-Simons state, instead, becomes a packet with a Gaussian probability distribution in connection space. We conclude the paper with two sections explaining how to generalize these results beyond minisuperspace.