Related papers: Ice-Flower Systems And Star-graphic Lattices

Indistinguishability of particles is normally considered to be an inherently quantum property which cannot be possessed by a classical theory. However, Saunders has argued that this is incorrect, and that classically indistinguishable…

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…

Quantization of classical systems using the star-product of symbols of observables is discussed. In the star-product scheme an analysis of dual structures is performed and a physical interpretation is proposed. At the Lie algebra level…

We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…

Graph clustering or community detection constitutes an important task for investigating the internal structure of graphs, with a plethora of applications in several domains. Traditional techniques for graph clustering, such as spectral…

Three-dimensional lattices are fundamental to solid-state physics. The description of a lattice with an atomic basis constitutes the necessary information to predict solid phase properties and evolution. Here, we present a new algorithm for…

We map certain highly correlated electron systems on lattices with geometrical frustration in the motion of added particles or holes to the spatial defect-defect correlations of dimer models in different geometries. These models are studied…

Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…

The Galois lattice is a graphic method of representing knowledge structures. The first basic purpose in this paper is to introduce a new class of Galois lattices, called graded Galois lattices. As a direct result, one can obtain the notion…

Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…

Lattices of Ir clusters have been grown by vapor phase deposition on graphene moir\'{e}s on Ir(111). The clusters are highly ordered, spatially and thermally stable below 500K. Their narrow size distribution is tunable from 4 to about 130…

An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…

Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…

Polar ice cores play a central role in studies of the earth's climate system through natural archives. A pressing issue is the analysis of the oldest, highly thinned ice core sections, where the identification of paleoclimate signals is…

Lattice field theory methods, usually associated with non-perturbative studies of quantum chromodynamics, are becoming increasingly common in the calculation of ground-state and thermal properties of strongly interacting non-relativistic…

This paper shows by computer simulations that some crystalline systems have curves in their thermodynamic phase diagrams, so-called isomorphs, along which structure and dynamics in reduced units are invariant to a good approximation. The…

Graph coloring, also known as vertex coloring, considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimization version of the problem concerns the minimization of the…

We describe a 3D percolation-type approach to modeling of the processes of aging and certain other properties of tissues analyzed as systems consisting of interacting cells. Lattice sites are designated as regular (healthy) cells, senescent…

We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…