相关论文: Delone sets associated with badly approximable tri…

Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic…

The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets $P$ in the plane. DT is not unique when $P$ is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve…

We study del Pezzo surfaces of degree 1 of the form w^2 = z^3 + Ax^6 + By^6 in the weighted projective space P_k(1,1,2,3), where k is a perfect field of characteristic not 2 or 3 and A,B \in k^*. Over a number field, we exhibit an infinite…

We consider linear and obstacle problems driven by a nonlocal integral operator, for which nonlocal interactions are restricted to a ball of finite radius. These type of operators are used to model anomalous diffusion and, for a special…

Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…

We address the problem of determining finite subsets of Delone sets $\varLambda\subset\R^d$ with long-range order by $X$-rays in prescribed $\varLambda$-directions, i.e., directions parallel to non-zero interpoint vectors of $\varLambda$.…

Linearly repetitive Delone sets are shown to be rectifiable by a bi-Lipschitz homeomorphisms of the Euclidean space that sends the Delone set to the set of points with integer coordinates.

This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…

The computation of (i) $\varepsilon$-kernels, (ii) approximate diameter, and (iii) approximate bichromatic closest pair are fundamental problems in geometric approximation. In this paper, we describe new algorithms that offer significant…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

This study reexamines diffusive representations for fractional integrals with the goal of pioneering new variants of such representations. These variants aim to offer highly efficient numerical algorithms for the approximate computation of…

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

For a locally finite set in $\mathbb{R}^2$, the order-$k$ Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…

We call a badly approximable number $decaying$ if, roughly, the Lagrange constants of integer multiples of that number decay as fast as possible. In this terminology, a question of Y. Bugeaud ('15) asks to find the Hausdorff dimension of…