scholarly journals Geometric Estimates in Interpolation on an n-Dimensional Ball

2020 ◽  
Vol 54 (7) ◽  
pp. 712-718
Author(s):  
M. V. Nevskii
Keyword(s):  
Dimensional Ball ◽  
Geometric Estimates

scholarly journals Geometric Estimates in Interpolation on an n-Dimensional Ball

2019 ◽  
Vol 26 (3) ◽  
pp. 441-449
Author(s):  
Mikhail V. Nevskii
Keyword(s):  
Legendre Polynomial ◽  
Polynomial Interpolation ◽  
Linear Interpolation ◽  
Continuous Functions ◽  
Unit Cube ◽  
Linear Functions ◽  
Dimensional Unit ◽  
Euclidean Unit Ball ◽  
Dimensional Ball ◽  
Geometric Estimates

Suppose \(n\in {\mathbb N}\). Let \(B_n\) be a Euclidean unit ball in \({\mathbb R}^n\) given by the inequality \(\|x\|\leq 1\), \(\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}\). By \(C(B_n)\) we mean a set of continuous functions \(f:B_n\to{\mathbb R}\) with the norm \(\|f\|_{C(B_n)}:=\max\limits_{x\in B_n}|f(x)|\). The symbol \(\Pi_1\left({\mathbb R}^n\right)\) denotes a set of polynomials in \(n\) variables of degree \(\leq 1\), i.e. linear functions upon \({\mathbb R}^n\). Assume that \(x^{(1)}, \ldots, x^{(n+1)}\) are vertices of an \(n\)-dimensional nondegenerate simplex \(S\subset B_n\). The interpolation projector \(P:C(B_n)\to \Pi_1({\mathbb R}^n)\) corresponding to \(S\) is defined by the equalities \(Pf\left(x^{(j)}\right)=f\left(x^{(j)}\right).\) Denote by \(\|P\|_{B_n}\) the norm of \(P\) as an operator from \(C(B_n)\) on to \(C(B_n)\). Let us define \(\theta_n(B_n)\) as the minimal value of \(\|P\|_{B_n}\) under the condition \(x^{(j)}\in B_n\). We describe the approach in which the norm of the projector can be estimated from the bottom through the volume of the simplex. Let \(\chi_n(t):=\frac{1}{2^nn!}\left[ (t^2-1)^n \right] ^{(n)}\) be the standardized Legendre polynomial of degree \(n\). We prove that \(\|P\|_{B_n}\geq\chi_n^{-1}\left(\frac{vol(B_n)}{vol(S)}\right).\) From this, we obtain the equivalence \(\theta_n(B_n)\) \(\asymp\) \(\sqrt{n}\). Also we estimate the constants from such inequalities and give the comparison with the similar relations for linear interpolation upon the \(n\)-dimensional unit cube. These results have applications in polynomial interpolation and computational geometry.

scholarly journals A three dimensional ball quotient

2013 ◽  
Vol 276 (1-2) ◽  
pp. 345-370
Author(s):  
Eberhard Freitag ◽  
Riccardo Salvati Manni
Keyword(s):  
Three Dimensional ◽  
Dimensional Ball

GEOMETRIC ESTIMATES OF HERITABILITY IN BIOLOGICAL SHAPE

Evolution ◽  
2002 ◽  
Vol 56 (3) ◽  
pp. 563 ◽  
Author(s):  
Leandro R. Monteiro ◽  
José Alexandre F. Diniz-Filho ◽  
Sérgio F. dos Reis ◽  
Edilson D. Araújo
Keyword(s):  
Biological Shape ◽  
Geometric Estimates

scholarly journals Twin-width I: Tractable FO Model Checking

2022 ◽  
Vol 69 (1) ◽  
pp. 1-46
Author(s):  
Édouard Bonnet ◽  
Eun Jung Kim ◽  
Stéphan Thomassé ◽  
Rémi Watrigant
Keyword(s):  
Model Checking ◽  
Elementary Function ◽  
First Order ◽  
Fpt Algorithm ◽  
Fixed Parameter ◽  
Dimension 2 ◽  
Bounded Size ◽  
Map Graphs ◽  
Dimensional Ball ◽  
Bounded Width

Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA’14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, K t -free unit d -dimensional ball graphs, posets with antichains of bounded size, and proper subclasses of dimension-2 posets all have bounded twin-width. On all these classes (except map graphs without geometric embedding) we show how to compute in polynomial time a sequence of d -contractions , witness that the twin-width is at most d . We show that FO model checking, that is deciding if a given first-order formula ϕ evaluates to true for a given binary structure G on a domain D , is FPT in |ϕ| on classes of bounded twin-width, provided the witness is given. More precisely, being given a d -contraction sequence for G , our algorithm runs in time f ( d ,|ϕ |) · |D| where f is a computable but non-elementary function. We also prove that bounded twin-width is preserved under FO interpretations and transductions (allowing operations such as squaring or complementing a graph). This unifies and significantly extends the knowledge on fixed-parameter tractability of FO model checking on non-monotone classes, such as the FPT algorithm on bounded-width posets by Gajarský et al. [FOCS’15].

scholarly journals FOUR-DIMENSIONAL BALL IN A GRAPHIC REPRESENTATION

2021 ◽  
pp. 37-46
Author(s):  
Helena Bidnichenko
Keyword(s):  
Dimensional Space ◽  
Three Dimensional ◽  
Geometric Modelling ◽  
Vector Model ◽  
Original Position ◽  
Two Dimensional ◽  
Axis Of Rotation ◽  
Dimensional Ball ◽  
Three Dimensional Space ◽  
Horizontal Vector

The paper presents a method for geometric modelling of a four-dimensional ball. For this, the regularities of the change in the shape of the projections of simple geometric images of two-dimensional and three-dimensional spaces during rotation are considered. Rotations of a segment and a circle around an axis are considered; it is shown that during rotation the shape of their projections changes from the maximum value to the degenerate projection. It was found that the set of points of the degenerate projection belongs to the axis of rotation, and each n-dimensional geometric image during rotation forms a body of a higher dimension, that is, one that belongs to (n + 1) -dimensional space. Identified regularities are extended to the four-dimensional space in which the ball is placed. It is shown that the axis of rotation of the ball will be a degenerate projection in the form of a circle, and the ball, when rotating, changes its size from a volumetric object to a flat circle, then increases again, but in the other direction (that is, it turns out), and then in reverse order to its original position. This rotation is more like a deformation, and such a ball of four-dimensional space is a hypersphere. For geometric modelling of the hypersphere and the possibility of its projection image, the article uses the vector model proposed by P.V. Filippov. The coordinate system 0xyzt is defined. The algebraic equation of the hypersphere is given by analogy with the three-dimensional space along certain coordinates of the center a, b, c, d. A variant of hypersection at t = 0 is considered, which confirms by equations obtaining a two-dimensional ball of three-dimensional space, a point (a ball of zero radius), which coincides with the center of the ball, or an imaginary ball. For the variant t = d, the equation of a two-dimensional ball is obtained, in which the radius is equal to R and the coordinates of all points along the 0t axis are equal to d. The variant of hypersection t = k turned out to be interesting, in which the equation of a two-dimensional sphere was obtained, in which the coordinates of all points along the 0t axis are equal to k, and the radius is . Horizontal vector projections of hypersection are constructed for different values of k. It is concluded that the set of horizontal vector projections of hypersections at t = k defines an ellipse.  

scholarly journals A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †

Information ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 133
Author(s):  
Arnaud Sipasseuth ◽  
Thomas Plantard ◽  
Willy Susilo
Keyword(s):  
Uniform Distribution ◽  
Random Noise ◽  
Theoretical Framework ◽  
New Method ◽  
Signature Scheme ◽  
Secret Key ◽  
Initial Work ◽  
Dimensional Ball ◽  
Diagonal Reduction

At PKC 2008, Plantard et al. published a theoretical framework for a lattice-based signature scheme, namely Plantard–Susilo–Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DRS) scheme was presented in the National Institute of Standards and Technology (NIST) PQC Standardization as a concrete instantiation of the initial work. Unfortunately, the initial submission was challenged by Yu and Ducas using the structure that is present on the secret key noise. In this paper, we are proposing a new method to generate random noise in the DRS scheme to eliminate the aforementioned attack, and all subsequent potential variants. This involves sampling vectors from the n-dimensional ball with uniform distribution. We also give insight on some underlying properties which affects both security and efficiency on the PSW type schemes and beyond, and hopefully increase the understanding on this family of lattices.

scholarly journals Geometric estimates for complex Monge–Ampère equations

2020 ◽  
Vol 2020 (765) ◽  
pp. 69-99 ◽  
Author(s):  
Xin Fu ◽  
Bin Guo ◽  
Jian Song
Keyword(s):  
Einstein Metrics ◽  
Kähler Manifolds ◽  
Singular Solutions ◽  
Kahler Manifolds ◽  
Diameter Estimate ◽  
Uniform Diameter ◽  
Kähler Einstein Metrics ◽  
Geometric Regularity ◽  
Monge Ampere ◽  
Geometric Estimates

AbstractWe prove uniform gradient and diameter estimates for a family of geometric complex Monge–Ampère equations. Such estimates can be applied to study geometric regularity of singular solutions of complex Monge–Ampère equations. We also prove a uniform diameter estimate for collapsing families of twisted Kähler–Einstein metrics on Kähler manifolds of nonnegative Kodaira dimensions.

Sign in / Sign up

Export Citation Format

Share Document