Related papers: Directional discrepancy in two dimensions
We find generators for the algebra of rational differential invariants for general and degenerate Kundt spacetimes and relate this to other approaches to the equivalence problem for Lorentzian metrics. Special attention is given to…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
This article is devoted to the study of mappings defined in the region on the plane. Under certain conditions, the upper estimate of the distortion of the modulus of families of paths is obtained. Similarly, the upper estimate of the…
We investigate the connection between maximal directional derivatives and differentiability for Lipschitz functions defined on Laakso space. We show that maximality of a directional derivative for a Lipschitz function implies…
The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…
We discuss an elementary derivation of variational symmetries and corresponding integrals of motion for the Lagrangian systems depending on acceleration. Providing several examples, we make the manuscript accessible to a wide range of…
We construct new Delone sets associated with badly approximable numbers which are expected to have rotationally invariant diffraction. We optimize the discrepancy of corresponding tile orientations by investigating the linear equation…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
In many mathematical models for pattern formation, a regular hexagonal pattern is stable in an infinite region. However, laboratory and numerical experiments are carried out in finite domains, and this imposes certain constraints on the…
In this contribution, discrete semiclassical orthogonal polynomials of class $s\leq2$ are studied. By considering all possible solutions of the Pearson equation, we obtain the canonical families in each class. We also consider limit…
In the present note, we examine the behavior of some homo\-thecy-invariant differentiation basis of rectangles in the plane satisfying the following requirement: for a given rectangle to belong to the basis, the ratio of the largest of its…
In this paper we generalize in Lorentz-Minkowski space $\l^3$ the two-dimensional analogue of the catenary of Euclidean space. We solve the Dirichlet problem for bounded mean convex domains and spacelike boundary data that have a spacelike…
We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…
Based on a fairly precise approximation to the lattice discrepancy of a Lame disc, an asymptotic formula is established for the number of lattice points in a related three-dimensional body, linearly dilated by a large real parameter x.…
Semi-Riemannian manifolds that satisfy (homogeneous) linear differential conditions of arbitrary order on the curvature are analyzed. They include, in particular, the spaces with (higher-order) recurrent curvature, (higher-order) symmetric…
In [Kopteva, Math. Comp., 2014] a counterexample of an anisotropic triangulation was given on which the exact solution has a second-order error of linear interpolation, while the computed solution obtained using linear finite elements is…
Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their reverse-convexity. We develop new algorithms for tightening…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…