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

More than ten years ago in 2008, a new kind of graph coloring appeared in graph theory, which is the {\it rainbow connection coloring} of graphs, and then followed by some other new concepts of graph colorings, such as {\it proper…

We consider the role of the diffeomorphism constraint in the quantization of lattice formulations of diffeomorphism invariant theories of connections. It has been argued that in working with abstract lattices, one automatically takes care…

We use our theory of periodized discrete elasticity to characterize defects in graphene as the cores of dislocations or groups of dislocations. Earlier numerical implementations of the theory predicted some of the simpler defect groupings…

In the last 25 years, much progress has been made producing and controlling Bose-Einstein condensates (BECs) and degenerate Fermi gases. The advances in trapping, cooling and tuning the interparticle interactions in these cold atom systems…

We introduce the notion of \textit{star cluster} of a simplex in a simplicial complex. This concept provides a general tool to study the topology of independence complexes of graphs. We use star clusters to answer a question arisen from…

We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge…

Lotuses are certain types of finite contractible simplicial complexes, obtained by identifying vertices of polygons subdivided by diagonals. As we explained in a previous paper, each time one resolves a complex reduced plane curve…

Formulating gauge theories on a lattice offers a genuinely non-perturbative way of studying quantum field theories, and has led to impressive achievements. In particular, it significantly deepened our understanding of quantum…

We study the dynamics of an infinite regular lattice of classical charged oscillators. Each individual oscillator is described as a point particle subject to a harmonic restoring potential, to the retarded electromagnetic field generated by…

We investigate the formation of cluster crystals with multiply occupied lattice sites on a spherical surface in systems of ultra-soft particles interacting via repulsive, bounded pair potentials. Not all interactions of this kind lead to…

Based on classical statistical thermodynamics, we develop a theoretical approach that provides new insight into how macroscopic and microscopic physical properties are bridged via crystal lattice for condensed mat- ters. We find that in…

This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…

We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum chromatic numbers are smaller than the classical chromatic…

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…

We investigate the connections between some simple Maier-Saupe lattice models, with a discrete choice of orientations of the microscopic directors, and a recent proposal of a two-tensor formalism to describe the phase diagrams of nematic…

Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…

In this work we discuss logical structures related to indistinguishable particles. Most of the framework used to develop these structures was presented in [17, 28] and in [20, 14, 15, 16]. We use these structures and constructions to…

As the scale of networked control systems increases and interactions between different subsystems become more sophisticated, questions of the resilience of such networks increase in importance. The need to redefine classical system and…

A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G that contains no monochromatic maximal stars…

We deal with the problem of decomposing a complete geometric graph into plane star-forests. In particular, we disprove a recent conjecture by Pach, Saghafian and Schnider by constructing for each $n$ a complete geometric graph on $n$…