Related papers: Unveiling Crystal Embeddings: New Perspectives on …
Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the same weight from the compositions of their prefixes and…
Polyhedra and their arrangements have intrigued humankind since the ancient Greeks and are today important motifs in condensed matter, with application to many classes of liquids and solids. Yet, little is known about the thermodynamically…
We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight…
We continue work begun in \cite{ptab} which introduced \emph{perforated tableaux} as a combinatorial model for crystals of type $A_{n-1}$, emphasizing connections to the classical Robinson-Schensted-Knuth (RSK) correspondence and Lusztig…
Given a complex simple Lie algebra $\mathfrak g$ and a dominant weight $\lambda$, let $\mathcal B_\lambda$ be the crystal poset associated to the irreducible representation of $\mathfrak g$ with highest weight $\lambda$. In the first part…
We define three combinatorial models for \hat{sl(n)} crystals, parametrized by partitions, configurations of beads on an `abacus', and cylindric plane partitions, respectively. These are reducible, but we can identify an irreducible…
For irreducible integrable highest weight modules of the finite and affine Lie algebras of type A and D, we define an isomorphism between the geometric realization of the crystal graphs in terms of irreducible components of Nakajima quiver…
The current classification of $\mathcal{N} = 1$ string theories in eight and seven dimensions is completely captured by K3 surfaces with F-Theory or M-Theory frozen singularities. In this note we show that there are inequivalent ways of…
We consider the classical exact multiple string matching problem. Our solution is based on $q$-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various…
We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n^{1.5} log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our…
Based on classical nucleation theory, we propose a couple of theoretical models for the nucleation of polymer crystallization, i.e. one for a single chain system (Model S) and the other for a multi-chain system (Model M). In these models,…
We create a multi-partite entangled state by storing a single photon in a crystal that contains many large atomic ensembles with distinct resonance frequencies. The photon is re-emitted at a well-defined time due to an interference effect…
One of the great challenges of modern science is to faithfully model, and understand, matter at a wide range of scales. Starting with atoms, the vastness of the space of possible configurations poses a formidable challenge to any simulation…
The superform construction of supersymmetric invariants, which consists of integrating the top component of a closed superform over spacetime, is reviewed. The cohomological methods necessary for the analysis of closed superforms are…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…
Positional polymorphism in solids refers to locally disordered unit cells that, on average, reproduce the high-symmetry structures observed in diffraction experiments. Standard theories of electron-phonon interactions fail to describe the…
We develop a computational method for evaluating the damping of vibrational modes in mono-atomic metallic chains suspended between bulk crystals under external strain. The damping is due to the coupling between the chain and contact modes…
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…
Starting from an adapted Whitney decomposition of tube domains in $\C^n$ over irreducible symmetric cones of $\R^n,$ we prove an atomic decomposition theorem in mixed norm weighted Bergman spaces on these domains. We also characterize the…
Generative models have achieved impressive results in many domains including image and text generation. In the natural sciences, generative models have led to rapid progress in automated drug discovery. Many of the current methods focus on…