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

Ultracold atoms are crucial for unlocking truly precise and accurate quantum metrology, and provide an essential platform for quantum computing, communication and memories. One of the largest ongoing challenges is the miniaturization of…

In a graph, a Clique-Stable Set separator (CS-separator) is a family $\mathcal{C}$ of cuts (bipartitions of the vertex set) such that for every clique $K$ and every stable set $S$ with $K \cap S = \emptyset$, there exists a cut $( W,W')$ in…

Symmetry-breaking bifurcations, where a flow state with a certain symmetry undergoes a transition to state with a different symmetry, are ubiquitous in fluid mechanics. Much can be understood about the nature of these transitions from…

Crystal structure prediction algorithms have become powerful tools for materials discovery in recent years, however, they are usually limited to relatively small systems. The main challenge is that the number of local minima grows…

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

Let $G$ be a connected multigraph with $n$ vertices, and suppose $G$ has been edge-colored with $n-1$ colors so that each color class induces a spanning tree. Rota's Basis Conjecture for graphic matroids posits that one can find $n-1$…

We review recent developments in the physics of ultracold atomic and molecular gases in optical lattices. Such systems are nearly perfect realisations of various kinds of Hubbard models, and as such may very well serve to mimic condensed…

The color-flavor transformation is a mathematical result that has applications to problems as diverse as lattice gauge theory, random network models, and dynamical systems. Several variants are described, and an outline of the proof is…

A Star Coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum number of colors required for such a star coloring of G is called star chromatic number, denoted…

The phase diagram of binary mixtures of particles interacting via a pair potential of parallel dipoles is computed at zero temperature as a function of composition and the ratio of their magnetic susceptibilities. Using lattice sums, a rich…

The thermodynamics of a charge-asymmetric lattice gas of positive ions carrying charge $q$ and negative ions with charge $-zq$ is investigated using Debye-H\"uckel theory. Explicit analytic and numerical calculations, which take into…

This study presents a novel algorithm based on graph theory for the precise segmentation and measurement of detonation cells from 3D pressure traces, termed detonation lattices, addressing the limitations of manual and primitive 2D edge…

We, for anti-quantum computing, will discuss various number-based strings, such as number-based super-strings, parameterized strings, set-based strings, graph-based strings, integer-partitioned and integer-decomposed strings, Hanzi-based…

We discuss Cauchy type decompositions of crystal graphs for general linear Lie superalgebras. More precisely, we consider bicrystal graph structures on various sets of matrices of non-negative integers, and obtain their decompositions with…

Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…

Assume that \Gamma_{v_0} is a tree with vertex set Vert(\Gamma_{v_0})={v_0, v_1,..., v_n}, and with an integral framing (weight) attached to each vertex except v_0. Assume furthermore that the intersection matrix of G=\Gamma_{v_0}-{v_0} is…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

We present a novel method to perform quantum state tomography for many-particle systems which are particularly suitable for estimating states in lattice systems such as of ultra-cold atoms in optical lattices. We show that the need for…

We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…

List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…