相关论文: Ice-Flower Systems And Star-graphic Lattices
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…
We present a novel way to manipulate ultra-cold atoms where four atomic levels are trapped by appropriately tuned optical lattices. When employed to perform quantum computation via global control, this unique structure dramatically reduces…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…
A theoretical analysis of Coulomb systems on lattices in general dimensions is presented. The thermodynamics is developed using Debye-Huckel theory with ion-pairing and dipole-ion solvation, specific calculations being performed for 3D…
The origin of many quantum-material phenomena is intimately related to the presence of flat electronic bands. In quantum simulation, such bands have been realized through line-graph lattices, a class of lattices known to exhibit flat bands.…
One perspective on tree decompositions is that they display (low-order) separations of the underlying graph or matroid. The separations displayed by a tree decomposition are necessarily nested. In 2013, Clark and Whittle proved the…
Glass-forming liquids have been extensively studied in recent decades, but there is still no theory that fully describes these systems, and the diversity of treatments is in itself a barrier to understanding. Here we introduce a new simple…
We study lattices acting on $\mathrm{CAT}(0)$ spaces via their commensurated subgroups. To do this we introduce the notions of a graph of lattices and a complex of lattices giving graph and complex of group splittings of $\mathrm{CAT}(0)$…
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
Correlation of interacting particles is studied in their dynamics and localization in ideal and disordered lattice systems with the help of numerical tools. Both 1D and 2D systems are considered. In 1D lattices with long-range hopping,…
We generate and study an ensemble of isostatic jammed hard-sphere lattices. These lattices are obtained by compression of a periodic system with an adaptive unit cell containing a single sphere until the point of mechanical stability. We…
In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…
Using a graph approach to quantum systems, we prove that descriptions of 3-dim Kochen-Specker (KS) setups as well as descriptions of 3-dim spin systems by means of Greechie lattices that we find in the literature are wrong. Correct lattices…
There has been a surge of experimental effort recently in cooling trapped fermionic atoms to quantum degeneracy. By varying an external magnetic field, interactions between atoms can be made arbitrarily strong. When the S wave scattering…
We consider atomistic systems consisting of interacting particles arranged in atomic lattices whose quasi-static evolution is driven by time-dependent boundary conditions. The interaction of the particles is modeled by classical interaction…
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…
A novel construction of lattices is proposed. This construction can be thought of as Construction A with codes that can be represented as the Cartesian product of $L$ linear codes over $\mathbb{F}_{p_1},\ldots,\mathbb{F}_{p_L}$,…
We analyze pattern formation on a network of cells where each cell inhibits its neighbors through cell-to-cell contact signaling. The network is modeled as an interconnection of identical dynamical subsystems each of which represents the…