Results 1 to 10 of about 116,736 (210)
Dual vectors and lower bounds for the nearest lattice point problem [PDF]
Combinatorica, 1988 Let \(L\) be a lattice in \(\mathbb R^ n\) and let \(L^*\) be its dual. The author shows that for each \(x\in\mathbb R^ n\setminus L\) there exists a nonzero \(v\in L^*\) such that \[ \frac{| \{(x,v)\}|}{\| v\|}\geq c_ n\cdot d(x,L), \] where \((x,v)\) is the usual inner product on \(\mathbb R^ n,\) \(\{\alpha\}\) the minimal distance of \(\alpha\) to ...
Johan Håstad
exaly +4 more sources
Towards a Converse for the Nearest Lattice Point Problem [PDF]
CoRR, 2017 Upper bounds on the communication complexity of finding the nearest lattice point in a given lattice $Λ\subset \mathbb{R}^2$ was considered in earlier works~\cite{VB:2017}, for a two party, interactive communication model. Here we derive a lower bound on the communication complexity of a key step in that procedure.
Vinay A. Vaishampayan
openaire +3 more sources
Fermionic quantum critical point of spinless fermions on a honeycomb lattice [PDF]
New Journal of Physics, 2014 Spinless fermions on a honeycomb lattice provide a minimal realization of lattice Dirac fermions. Repulsive interactions between nearest neighbors drive a quantum phase transition from a Dirac semimetal to a charge-density-wave state through a fermionic ...
Lei Wang +2 more
doaj +4 more sources
On the Interactive Communication Cost of the Distributed Nearest Lattice Point Problem.
CoRR, 2018 We consider the problem of distributed computation of the nearest lattice point for a two dimensional lattice. An interactive two-party model of communication is considered. Algorithms with bounded, as well as unbounded, number of rounds of communication
Vinay A. Vaishampayan, Maiara F. Bollauf
openaire +2 more sources
Математичні Студії, 2021 We consider an infinite system of ordinary differential equations that describes the dynamics of an infinite system of linearly coupled nonlinear oscillators on a two dimensional integer-valued lattice.
S.M. Bak, G. M. Kovtonyuk
doaj +1 more source
Vojnotehnički Glasnik, 2023 Introduction/purpose: In this paper, a new solution for solving a multiobjective integer programming problem with probabilistic multi – objective optimization is formulated.
Maosheng Zheng, Jie Yu
doaj +1 more source
Non-Abelian Analogs of Lattice Rounding [PDF]
, 2015 Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of non-abelian analogs of
Begelfor, Evgeni +2 more
core +2 more sources
Approximate Perturbation Aided Lattice Encoding (APPLE) for G.fast and Beyond
IEEE Access, 2018 G.fast suffers from strong far-end crosstalk at high frequencies in cable binders containing a large number of twisted copper pairs. For the 212-MHz G.fast spectrum, the power penalty incurred by the conventional zero-forcing precoding-based linear ...
Yangyishi Zhang +3 more
doaj +1 more source
Two-Flavor Lattice QCD with a Finite Density of Heavy Quarks: Heavy-Dense Limit and "Particle-Hole" Symmetry [PDF]
, 2015 We investigate the properties of the half-filling point in lattice QCD (LQCD), in particular the disappearance of the sign problem and the emergence of an apparent particle-hole symmetry, and try to understand where these properties come from by studying
de Forcrand, Philippe +1 more
core +1 more source
Some results on nearest points problems in Banach lattices
Journal of Nonlinear Analysis and Application, 2015 In this paper we prove that for two equivalent norms such that $X$ becomes an STM and LLUM space the dominated best approximation problem have the same solution. We give some conditions such that under these conditions the Frechet differentiability of the nearest point map is equivalent to the continuity of metric projection in the dominated best ...
H. R. Khademzadeh, H. Mazaheri
openaire +1 more source