A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a ... L. Narayanan and S. M. Shende - 《Algorithmica》 被引量: 198发表: 2001年 Linear choosability of graphs A proper vertex coloring ...
This work aims at providing new lower bounds for the diversity-multiplexing gain trade-off of a general class of lattice codes based on division algebras. In the low multiplexing gain regime, some bounds were previously obtained from the high signal-to-noise ratio estimate of the union bound fo...
The behavior of nonlinear waves within a modified Zakharov鈥揔uznetsov equation and their interactions with discrete electric lattice structures are examined in this study. The 6 6 model expansion method is utilized to acquire substantial knowledge into the complex dynamics of the system under consider...
lattice polytopesempty simplicesclassification of empty polytopesIn previous work we classified all empty 4-simplices of width at least three. We here classify those of width two. There are 2 two-parameter families that project to the second dilation of a unimodular triangle, 29+23 one-parameter...
In addition, two types of integrals are associated with the necessity measure in lattices. Several important properties including a monotone convergence theorem, are also obtained.关键词: Triangular co-norm L-necessity measure L-necessity integrals N-consistency complete lattice ...
T Banakh,V Gavrylkiv - 《Algebra & Discrete Mathematics》 被引量: 14发表: 2010年 Representation of artinian partially ordered sets over semiartinian Von Neumann regular algebras Moreover, if Prim R has no infinite antichains, then the lattice L 2 ( R ) of all ideals of R is anti-isomo...
off-shell Bethe vectors and Bethe vectors with arbitrary twists. We prove that the set of principal operators generates the complete spin chain Yangian. Furthermore, we derive the representation of these operators in the SoV bases allowing one to compute correlation functions with an arbitrary num...
This is a preview of subscription content, log in via an institution to check access. Similar content being viewed by others Public-Key Revocation and Tracing Schemes with Subset Difference Methods Revisited Chapter © 2014 Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions...
In this section,Wis assumed to be a nonnegative functionW(r)=er−1. When the oscillatorpotential vanishes, (5.1) presents the standard Toda lattice [12]. To find the equilibrium positions ofthe bi-infinite lattices, we can look for critical points of the total potential energyΦ((θn)n...
Computing a shortest nonzero vector of a given euclidean lattice and computing a closest lattice vector to a given target are pervasive problems in computer science, computational mathematics and communication theory. The classical algorithms for these tasks were invented by Ravi Kannan in 1983 and, ...