نتایج جستجو برای: lattice model

تعداد نتایج: 2173261  

2008
FARRUKH MUKHAMEDOV

We consider a nearest-neighbor inhomogeneous p-adic Potts (with q ≥ 2 spin values) model on the Cayley tree of order k ≥ 1. The inhomogeneity means that the interaction Jxy couplings depend on nearest-neighbors points x, y of the Cayley tree. We study (p− adic) Gibbs measures of the model. We show that (i) if q / ∈ pN then there is unique Gibbs measure for any k ≥ 1 and ∀Jxy with |Jxy | < p . (...

Journal: :Studia Logica 2012
Brian A. Davey Hilary A. Priestley

The paper investigates completions in the context of finitely generated lattice-based varieties of algebras. In particular the structure of canonical extensions in such a variety A is explored, and the role of the natural extension in providing a realisation of the canonical extension is discussed. The completions considered are Boolean topological algebras with respect to the interval topology...

2006
Mikhail Valeryevich Katkov

MODEL OF AN EXCITON-PHOTON SYSTEM INTERACTING WITH THE LATTICE

2009
Anastasia Doikou

We consider the double-row (open) transfer matrix constructed from generic representations of various types of Hecke algebras. For different choices of boundary conditions for the relevant integrable lattice model we express the double-row transfer matrix solely in terms of generators of the corresponding Hecke algebra. We then expand the open transfer matrix and extract the associated Murphy e...

2012
Gabriele NEBE Elisabeth NOSSEK Boris VENKOV Gabriele Nebe Elisabeth Nossek Boris Venkov

A lattice is called dual strongly perfect if both, the lattice and its dual, are strongly perfect. We show that there are no dual strongly perfect lattices of dimension 13 and 15.

2013
Chris Peikert Sara Krehbiel

Lattices have been used in mathematics going back at least to the 18th century. However, computational aspects of lattices were not investigated much until the early 1980s, when they were successfully employed for breaking several proposed cryptosystems (among many other applications). It was not until the late 1990s that lattices were first used in the design of cryptographic schemes, and the ...

Journal: :Int. J. Approx. Reasoning 2014
Yuhua Qian Hu Zhang Feijiang Li Qinghua Hu Jiye Liang

Article history: Received 15 January 2013 Received in revised form 12 October 2013 Accepted 8 November 2013 Available online 22 November 2013

Journal: :IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 1995
Jelena Kovacevic

We construct two-dimensional (2-D) local cosine bases in discrete time. Solutions are offered both for rectangular and nonrectangular lattices. In the case of nonrectangular lattices, the problem is solved by mapping it into a one-dimensional (1-D) equivalent problem.

2001
V V KONOTOP

An integrable discretization of an inhomogeneous Volterra lattice is introduced. Some aspects of dynamics of a soliton affected by a random force are discussed.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید