相关论文: Ice-Flower Systems And Star-graphic Lattices

Featuring excellent coherence and operated parallelly, ultracold atoms in optical lattices form a competitive candidate for quantum computation. For this, a massive number of parallel entangled atom pairs have been realized in…

A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not mapped to the same color. This constraint may be interpreted in terms of the distance between to vertices and so a…

We study quantum and classical Hanbury Brown-Twiss correlations in waveguide lattices. We develop a theory for the propagation of photon pairs in the lattice, predicting the emergence of nontrivial quantum interferences unique to lattice…

Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…

The quantum chromodynamics (QCD) phase diagram, which reveals the state of strongly interacting matter at different temperatures and densities, is key to answering open questions in physics, ranging from the behavior of particles in neutron…

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…

When two molecular species with mutual affinity are mixed together, various self-assembled phases can arise at low temperature, depending on the shape of like and unlike interactions. Among them, stripes -- where layers of one type are…

Globular cluster systems provide valuable fossil records of the formation history of their parent galaxies. This review specifically concentrates on using color distributions of the globular cluster systems of elliptical galaxies to…

A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each of its component is a star. Clearly, every graph without isolated vertices has a star factor. A graph $G$ is called {\it star-uniform} if all star-factors of…

We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems…

Architected materials possessing physico-chemical properties adaptable to disparate environmental conditions embody a disruptive new domain of materials science. Fueled by advances in digital design and fabrication, materials shaped into…

The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…

One of the demanding frontiers in ultracold quantum science is identifying laser cooling schemes for complex atoms and molecules out of their vast spectra of internal states. Motivated by the prospect of expanding the set of available…

We consider the problem of clustering data that reside on discrete, low dimensional lattices. Canonical examples for this setting are found in image segmentation and key point extraction. Our solution is based on a recent approach to…

Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this…

Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes. By building on the work of Gioan and Paul (2012)…

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…

When interactions between particles are strong, at low temperature, these particles can form self-organized quantum crystals, and when the particles interact weakly, periodic structures can be imposed by external fields, e.g. by optical…

In this paper, we construct solvable ice models (six-vertex models) with stochastic weights and U-turn right boundary, which we term ``stochastic symplectic ice''. The models consist of alternating rows of two types of vertices. The…

I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software…