On the Identification of Sets of Points in the Square Lattice

Abstract. Identifying codes in the square lattice are considered. The motivation for these codes is the following: if a multiprocessor system is modelled by the square lattice, then we can locate faulty processors in the system with the aid of identifying codes. Constructions, some of which are optimal, are given.     

Representation fields for quaternionic skew-hermitian forms

Classes of indefinite quadratic forms in a genus are in correspondence with the Galois group of an abelian extension called the spinor class field (Estes and Hsia, Japanese J. Math. 16, 341–350 (1990)). Hsia has proved (Hsia et al., J. Reine Angew. Math. 494, 129–140 (1998)) the existence of a representation field F with the property that a lattice in the genus represents a fixed given lattice if and only if the corresponding element of the Galois group is trivial on F. This far, the corresponding result for skew-hermitian forms was known only in some special cases, e.g., when the ideal (2) is square free over the base field. In this work we prove the existence of representation fields for quaternionic skew-hermitian forms in complete generality.     

Subdirect products of hereditary congruence lattices

A congruence lattice L of an algebra A is called power-hereditary if every 0-1 sublattice of Lⁿ is the congruence lattice of an algebra on Aⁿ for all positive integers n. Let A and B be finite algebras. We prove

Binary self-dual codes with automorphisms of order 23

The only example of a binary doubly-even self-dual [120,60,20] code was found in 2005 by Gaborit et al. (IEEE Trans Inform theory 51, 402–407 2005). In this work we present 25 new binary doubly-even self-dual [120,60,20] codes having an automorphism of order 23. Moreover we list 7 self-dual [116,58,18] codes, 30 singly-even self-dual [96,48,16] codes and 20 extremal self-dual [92,46,16] codes. All codes are new and present different weight enumerators.      

Two-dimensional interpolation-supplemented and Taylor-series expansion-based lattice Boltzmann method and its application

Two-dimensional interpolation-supplemented and Taylor-series expansion-based lattice Boltzmann method (ITLBM) is proposed to simulate flows in the non-uniform grids. The proposed method is based on the standard lattice Boltzmann method, interpolation-supplemented and Taylor-series expansion. The final formulation can be used on any mesh structure and lattice Boltzmann model. Numerical test of a two-dimensional channel flow around a square cylinder has been studied. The computational efficient and recirculation length at Re = 1, 15 are obtained. Comparing the results from the ITLBM with those from the standard LBM, it has been concluded that the proposed method has good prospects in the hydrodynamic and aerodynamic engineering applications.     

Some cyclic codes of length 2<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Explicit expressions for 4n + 2 primitive idempotents in the semi-simple group ring $R_{2p^{n}}\equiv \frac{GF(q)[x]}{p and q are distinct odd primes; n ≥ 1 is an integer and q has order \fracf(2pⁿ)2{\frac{\phi(2p^{n})}{2}} modulo 2p ⁿ . The generator polynomials, the dimension, the minimum distance of the minimal cyclic codes of length 2p ⁿ generated by these 4n + 2 primitive idempotents are discussed. For n = 1, the properties of some (2p, p) cyclic codes, containing the above minimal cyclic codes are analyzed in particular. The minimum weight of some subset of each of these (2p, p) codes are observed to satisfy a square root bound.     

Cooperation in spatial prisoner’s dilemma game with delayed decisions

Phenomena that time delays of information lead to delayed decisions are extensive in reality. The effect of delayed decisions on the evolution of cooperation in the spatial prisoner’s dilemma game is explored in this work. Players with memory are located on a two dimensional square lattice, and they can keep the payoff information of his neighbors and his own in every historic generation in memory. Every player uses the payoff information in some generation from his memory and the strategy information in current generation to determine which strategy to choose in next generation. The time interval between two generations is set by the parameter m. For the payoff information is used to determine the role model for the focal player when changing strategies, the focal player’s decision to learn from which neighbor is delayed by m generations. Simulations show that cooperation can be enhanced with the increase of m. In addition, just like the original evolutionary game model (m = 0), pretty dynamic fractal patterns featuring symmetry can be obtained when m > 0 if we simulate the invasion of a single defector in world of cooperators on square lattice.     

Imbedded Circle Patterns with the Combinatorics of the Square Grid and Discrete Painlevé Equations

   Abstract. A discrete analogue of the holomorphic maps z ^γ and log(z) is studied. These maps are given by Schramm's circle pattern with the combinatorics of the square grid. It is shown that the corresponding circle patterns are imbedded and described by special separatrix solutions of discrete Painlevé equations. Global properties of these solutions, as well as of the discrete z ^γ and log(z) , are established.     

Consequences of Pure Point Diffraction Spectra for Multiset Substitution Systems

   Abstract. There is a growing body of results in the theory of discrete point sets and tiling systems giving conditions under which such systems are pure point diffractive. Here we look at the opposite direction: what can we infer about a discrete point set or tiling, defined through a primitive substitution system, given that it is pure point diffractive? Our basic objects are Delone multisets and tilings, which are self-replicating under a primitive substitution system of affine mappings with a common expansive map Q . Our first result gives a partial answer to a question of Lagarias and Wang: we characterize repetitive substitution Delone multisets that can be represented by substitution tilings using a concept of ``legal cluster.' This allows us to move freely between both types of objects. Our main result is that for lattice substitution multiset systems (in arbitrary dimensions), being a regular model set is not only sufficient for having pure point spectrum—a known fact—but is also necessary. This completes a circle of equivalences relating pure point dynamical and diffraction spectra, modular coincidence, and model sets for lattice substitution systems begun by the first two authors of this paper.     

Perfect Packings of Squares Using the Stack-Pack Strategy

   Abstract. We consider the problem of packing an infinite set of square tiles into a finite number of rectangular boxes. We introduce a simple packing strategy that we call stack-pack. Using this strategy, we prove that if 1/2 < t < 2/3, then the squares of side n ^-t , for positive integers n , can be packed into some finite collection of square boxes of the same area ζ(2t) as the total area of the tiles.     

On the classification of perfect codes: side class structures

The side class structure of a perfect 1-error correcting binary code (hereafter referred to as a perfect code) C describes the linear relations between the coset representatives of the kernel of C. Two perfect codes C and C′ are linearly equivalent if there exists a non-singular matrix A such that AC = C′ where C and C′ are matrices with the code words of C and C′ as columns. Hessler proved that the perfect codes C and C′ are linearly equivalent if and only if they have isomorphic side class structures. The aim of this paper is to describe all side class structures. It is shown that the transpose of any side class structure is the dual of a subspace of the kernel of some perfect code and vice versa; any dual of a subspace of a kernel of some perfect code is the transpose of the side class structure of some perfect code. The conclusion is that for classification purposes of perfect codes it is sufficient to find the family of all kernels of perfect codes.     

Improved Linear Programming Bounds for Antipodal Spherical Codes

   Abstract. Let S\subset[-1,1) . A finite set \Ccal=\set x _{i i=1} ^M \subset\Re ⁿ is called a spherical S-code if \norm x _i =1 for each i , and x _i \tran x _j ∈ S , i\ne j . For S=[-1, 0.5] maximizing M=|C| is commonly referred to as the kissing number problem. A well-known technique based on harmonic analysis and linear programming can be used to bound M . We consider a modification of the bounding procedure that is applicable to antipodal codes; that is, codes where x∈\Ccal\implies -x∈\Ccal . Such codes correspond to packings of lines in the unit sphere, and include all codes obtained as the collection of minimal vectors in a lattice. We obtain improvements in upper bounds for kissing numbers attainable by antipodal codes in dimensions 16≤ n≤ 23 . We also show that for n=4 , 6 and 7 the antipodal codes with maximal kissing numbers are essentially unique, and correspond to the minimal vectors in the laminated lattices \Lam _n .     

Order affine completeness of lattices with Boolean congruence lattices

This paper grew out from attempts to determine which modular lattices of finite height are locally order affine complete. A surprising discovery was that one can go quite far without assuming the modularity itself. The only thing which matters is that the congruence lattice is finite Boolean. The local order affine completeness problem of such lattices L easily reduces to the case when L is a subdirect product of two simple lattices L ₁ and L ₂. Our main result claims that such a lattice is locally order affine complete iff L ₁ and L ₂ are tolerance trivial and one of the following three cases occurs:

Exponential Decay for the Near-Critical Scaling Limit of the Planar Ising Model

We consider the Ising model at its critical temperature with external magnetic field ha^15/8 on the square lattice with lattice spacing a . We show that the truncated two-point function in this model decays exponentially with a rate independent of a as a ↓ 0 . As a consequence, we show exponential decay in the near-critical scaling limit Euclidean magnetization field. For the lattice model with a = 1 , the mass (inverse correlation length) is of order h^8/15 as h ↓ 0 ; for the Euclidean field, it equals exactly Ch^8/15 for some C . Although there has been much progress in the study of critical scaling limits, results on near-critical models are far fewer due to the lack of conformal invariance away from the critical point. Our arguments combine lattice and continuum FK representations, including coupled conformal loop and measure ensembles, showing that such ensembles can be useful even in the study of near-critical scaling limits. Thus we provide the first substantial application of measure ensembles. © 2020 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC.     

Some remarks on the Dirichlet problem in plane exterior domains

Abstract  In this paper we deal with the Dirichlet problem for the Laplace equation in a plane exterior domain Ω with a Lipschitz boundary. We prove that, if the boundary datum a is square summable, then the problem admits a solution which tends to a in the sense of nontangential convergence, is unique in a suitable function class and vanishes at infinity as r^–k if and only if a satisfies k compatibility conditions, which we are able to explicit when Ω is the exterior of an ellipse. Keywords: Dirichlet problem, Asymptotic behavior, Potential theory Mathematics Subject Classification (2000): 31A05, 31A10     

Influence of anti-diagonals on the asymptotic stability for linear differential systems

Sufficient conditions are given for asymptotic stability of the linear differential system x′  =  B(t)x with B(t) being a 2  ×  2 matrix. All components of B(t) are not assumed to be positive. The matrix B(t) is naturally divisible into a diagonal matrix D(t) and an anti-diagonal matrix A(t). Our concern is to clarify a positive effect of the anti-diagonal part A(t)x on the asymptotic stability for the system x′  =  B(t)x.      

Influence of anti-diagonals on the asymptotic stability for linear differential systems

Sufficient conditions are given for asymptotic stability of the linear differential system x′  =  B(t)x with B(t) being a 2  ×  2 matrix. All components of B(t) are not assumed to be positive. The matrix B(t) is naturally divisible into a diagonal matrix D(t) and an anti-diagonal matrix A(t). Our concern is to clarify a positive effect of the anti-diagonal part A(t)x on the asymptotic stability for the system x′  =  B(t)x.     

The mean number of sites visited by a pinned random walk

This paper concerns the number Z _n of sites visited up to time n by a random walk S _n having zero mean and moving on the d-dimensional square lattice Z ^d . Asymptotic evaluation of the conditional expectation of Z _n given that S ₀ = 0 and S _n = x is carried out under 2 + δ moment conditions (0 ≤ δ ≤ 2) in the cases d = 2, 3. It gives an explicit form of the leading term and reasonable estimates of the remainder term (depending on δ) valid uniformly in each parabolic region of (x, n). In the case x = 0 the problem has been studied for the simple random walk and its analogue for Brownian motion; the estimates obtained here are finer than or comparable to those found in previous works. Supported in part by Monbukagakusho grand-in-aid no. 15540109.     

Matrix Extension with Symmetry and Applications to Symmetric Orthonormal Complex M-wavelets

Matrix extension with symmetry is to find a unitary square matrix P of 2π-periodic trigonometric polynomials with symmetry such that the first row of P is a given row vector p of 2π-periodic trigonometric polynomials with symmetry satisfying p[`(p)]^T=1\mathbf {p}\overline{\mathbf{p}}^{T}=1 . Matrix extension plays a fundamental role in many areas such as electronic engineering, system sciences, wavelet analysis, and applied mathematics. In this paper, we shall solve matrix extension with symmetry by developing a step-by-step simple algorithm to derive a desired square matrix P from a given row vector p of 2π-periodic trigonometric polynomials with complex coefficients and symmetry. As an application of our algorithm for matrix extension with symmetry, for any dilation factor M, we shall present two families of compactly supported symmetric orthonormal complex M-wavelets with arbitrarily high vanishing moments. Wavelets in the first family have the shortest possible supports with respect to their orders of vanishing moments; their existence relies on the establishment of nonnegativity on the real line of certain associated polynomials. Wavelets in the second family have increasing orders of linear-phase moments and vanishing moments, which are desirable properties in numerical algorithms.