English
Related papers

Related papers: Delone sets associated with badly approximable tri…

200 papers

In these expository notes we focus on selected topics around the themes: Delone sets as models for quasicrystals, inflation symmetries and expansion constants, substitution Delone sets and tilings, and associated dynamical systems.

Dynamical Systems · Mathematics 2018-02-08 Boris Solomyak

Vector equilibrium problems are a natural generalization to the context of partially ordered spaces of the Ky Fan inequality, where scalar bifunctions are replaced with vector bifunctions. In the present paper, the local geometry of the…

Optimization and Control · Mathematics 2023-01-27 Amos Uderzo

We investigate the properties of a class of piecewise-fractional maps arising from the introduction of an invariance under rescaling into convex quadratic maps. The subsequent maps are quasiconvex, and pseudoconvex on specific convex cones;…

Optimization and Control · Mathematics 2025-04-25 Alexandra Zverovich , Matthew Hutchings , Bertrand Gauthier

In twisted Diophantine approximation, for a fixed $m\times n$ matrix $\boldsymbol\alpha$ one is interested in sets of vectors $\boldsymbol\beta\in\mathbb R^m$ such that the system of affine forms $\mathbb R^n \ni \mathbf q \mapsto…

Number Theory · Mathematics 2026-02-10 Victor Beresnevich , David Simmons , Sanju Velani

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

Metric Geometry · Mathematics 2017-11-27 Christian Richter , Melchior Wirth

Systems of fuzzy relation equations and inequalities in which an unknown fuzzy relation is on the one side of the equation or inequality are linear systems. They are the most studied ones, and a vast literature on linear systems focuses on…

Artificial Intelligence · Computer Science 2022-06-03 Stefan Stanimirovic , Ivana Micic

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

This work belongs to the framework of inverse problems with linear model. The resolution of this type of problem consists in minimizing (possibly under constraints) a function of discrepancy between the measurements and a physical model of…

Information Theory · Computer Science 2021-09-28 Henri Lantéri

This paper deals with some nonlinear problems which exponential and biexponential decays are involved in. A proof of the quasiconvexity of the error function in some of these problems of optimization is presented. This proof is restricted…

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…

Optimization and Control · Mathematics 2015-09-15 Fabrizio Dabbene , Didier Henrion , Constantino Lagoa

The main purpose of this article is to establish new uniqueness results for Calder\'on type inverse problems related to damped nonlocal wave equations. To achieve this goal we extend the theory of very weak solutions to our setting, which…

Analysis of PDEs · Mathematics 2024-12-04 Philipp Zimmermann

The numerical solution methods for partial differential equation (PDE) solution allow obtaining a discrete field that converges towards the solution if the method is applied to the correct problem. Nevertheless, the numerical methods…

Numerical Analysis · Mathematics 2021-03-04 Alexander Hvatov

The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…

Optimization and Control · Mathematics 2023-04-28 Ernesto G. Birgin , Antoine Laurain , Rafael Massambone , Arthur G. Santana

We present two approximate versions of the proximal subgradient method for minimizing the sum of two convex functions (not necessarily differentiable). The algorithms involve, at each iteration, inexact evaluations of the proximal operator…

Optimization and Control · Mathematics 2019-07-12 Reinier Díaz Millán , Majela Pentón Machado

For $d\in\{5,6\}$, we classify arrangements of $d + 2$ points in $\mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes…

Metric Geometry · Mathematics 2019-12-10 Dustin G. Mixon , Hans Parshall

Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…

Probability · Mathematics 2009-09-08 Adam Timar

Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder. The location of the axis and the radius of the…

Algebraic Geometry · Mathematics 2014-08-21 Michel Petitjean

In backward error analysis, an approximate solution to an equation is compared to the exact solution to a nearby modified equation. In numerical ordinary differential equations, the two agree up to any power of the step size. If the…

Numerical Analysis · Mathematics 2022-07-21 Robert I McLachlan , Christian Offen

Reducing communication - either between levels of a memory hierarchy or between processors over a network - is a key component of performance optimization (in both time and energy) for many problems, including dense linear algebra, particle…

Data Structures and Algorithms · Computer Science 2020-03-03 Grace Dinh , James Demmel

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

Machine Learning · Computer Science 2020-03-10 Pritish Kamath , Omar Montasser , Nathan Srebro