中文
相关论文

相关论文: Crystallographic Restrictions for Colour Lattices …

200 篇论文

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…

统计力学 · 物理学 2017-09-13 Sumanta Kundu , S. S. Manna

We give an introduction crystalline color superconductivity, arguing that it is likely to occur wherever quark matter in which color-flavor locking does not occur is found. We survey the properties of this form of quark matter, and argue…

高能物理 - 唯象学 · 物理学 2009-11-07 Krishna Rajagopal

A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…

组合数学 · 数学 2022-05-10 Robert G. Donnelly

Given the integral lattice $\Lambda^d$ in $d$-dimensional Euclidean space, partitions of the lattice nodes into orbits of finite-index subgroups of $Aut(\Lambda^d)$ have been computed for $d \leq 4$. These partitions can be interpreted as…

组合数学 · 数学 2025-10-22 Igor A. Baburin

Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$. A…

组合数学 · 数学 2018-03-22 David R. Wood

We study and classify proper $q$-colorings of the $\mathbb Z^d$ lattice, identifying three regimes where different combinatorial behavior holds: (1) When $q\le d+1$, there exist frozen colorings, that is, proper $q$-colorings of $\mathbb…

We study the properties of dipolar fermions trapped in one-dimensional bichromatic optical lattices and show the existence of fractional topological states in the presence of strong dipole-dipole interactions. We find some interesting…

量子气体 · 物理学 2013-05-28 Zhihao Xu , Linhu Li , Shu Chen

We prove that every graph with circumference at most $k$ is $O(\log k)$-colourable such that every monochromatic component has size at most $O(k)$. The $O(\log k)$ bound on the number of colours is best possible, even in the setting of…

组合数学 · 数学 2018-06-21 Bojan Mohar , Bruce Reed , David R. Wood

A submodule of a $\mathbb{Z}$-module determines a coloring of the module where each coset of the submodule is associated to a unique color. Given a submodule coloring of a $\mathbb{Z}$-module, the group formed by the symmetries of the…

度量几何 · 数学 2017-04-11 Manuel Joseph C. Loquias , Lilibeth D. Valdez , Ma. Lailani B. Walo

Colloidal crystals formed by size-asymmetric binary particles co-assemble into a wide variety of colloidal compounds with lattices akin to ionic crystals. Recently, a transition from a compound phase with a sublattice of small particles to…

软凝聚态物质 · 物理学 2023-09-12 Ali Ehlen , Hector Lopez-Rios , Monica Olvera de la Cruz

We study the existence of an $n$-fold rotationally symmetric placement of a symmetric graph in the plane allowing a continuous deformation that preserves the symmetry and the distances between adjacent vertices. We show that such a flexible…

组合数学 · 数学 2021-11-24 Sean Dewar , Georg Grasegger , Jan Legerský

Given a $k$-colouring of the edges of the complete graph $K_n$, are there $k-1$ monochromatic components that cover its vertices? This important special case of the well-known Lov\'asz-Ryser conjecture is still open. In this paper we…

组合数学 · 数学 2017-05-29 Luka Milićević

When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a…

数论 · 数学 2016-05-31 Maciej Borodzik , Danny Nguyen , Sinai Robins

For nonnegative integers $k, d_1, \ldots, d_k$, a graph is $(d_1, \ldots, d_k)$-colorable if its vertex set can be partitioned into $k$ parts so that the $i$th part induces a graph with maximum degree at most $d_i$ for all $i\in\{1, \ldots,…

组合数学 · 数学 2025-08-15 Ilkyoo Choi , Chun-Hung Liu , Sang-il Oum

Let P be a d-dimensional lattice polytope. We show that there exists a natural number c_d, only depending on d, such that the multiples cP have a unimodular cover for every natural number c >= c_d. Actually, a subexponential upper bound for…

组合数学 · 数学 2007-05-23 Winfried Bruns , Joseph Gubeladze

A hyperbolic lattice allows for any $p$-fold rotational symmetry, in stark contrast to a two-dimensional crystalline material, where only twofold, threefold, fourfold or sixfold rotational symmetry is permitted. This unique feature…

介观与纳米尺度物理 · 物理学 2023-05-25 Yu-Liang Tao , Yong Xu

A coding lattice $\Lambda_c$ and a shaping lattice $\Lambda_s$ forms a nested lattice code $\mathcal{C}$ if $\Lambda_s \subseteq \Lambda_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This…

信息论 · 计算机科学 2024-05-10 Chengpin Luo , Brian M. Kurkoski

In any context in which color superconductivity arises in nature, it is likely to involve pairing between species of quarks with differing chemical potentials. For suitable values of the differences between chemical potentials, Cooper pairs…

高能物理 - 唯象学 · 物理学 2010-11-19 Mark Alford , Jeffrey Bowers , Krishna Rajagopal

The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…

无序系统与神经网络 · 物理学 2007-05-23 Michael Baake , Uwe Grimm , Max Scheffer

In this paper, we study the unimodular equivalence of sublattices in an $n$-dimensional lattice. A recursive procedure is given to compute the cardinalities of the unimodular equivalent classes with the indices which are powers of a prime…

度量几何 · 数学 2023-10-20 Shikui Shang
‹ 上一页 1 2 3 10 下一页 ›