Related papers: Cut and project sets with polytopal window II: lin…
This paper concerns upper estimates of the projectional coderivative of implicit mappings and corresponding applications on analyzing the relative Lipschitz-like property. Under different constraint qualifications, we provide upper…
We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…
One-dimensional cut-and-project point sets obtained from the square lattice in the plane are considered from a unifying point of view and in the perspective of aperiodic wavelet constructions. We successively examine their geometrical…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
It is a classical observation that lacunary function systems exhibit many properties which are typical for systems of independent random variables. However, it had already been observed by Erd\H{o}s and Fortet in the 1950s that probability…
We give an explicit criterion for a rational lattice in the time-frequency plane to admit a Gabor frame with window in the Schwartz class. The criterion is an inequality formulated in terms of the lattice covolume, the dimension of the…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
The $\text{PSL}(4,\mathbb{R})$ Hitchin component of a closed surface group $\pi_1(S)$ consists of holonomies of properly convex foliated projective structures on the unit tangent bundle of $S$. We prove that the leaves of the…
In this paper, we recall the linear version of the lattice Boltzmann schemes in the framework proposed by d'Humi\'eres. According to the equivalent equations we introduce a definition for a scheme to be isotropic at some order. This…
Motivated by a model for the perception of textures by the visual cortex in primates, we analyse the bifurcation of periodic patterns for nonlinear equations describing the state of a system defined on the space of structure tensors, when…
Let $P$ be a set of points and $L$ a set of lines in the (extended) Euclidean plane, and $I \subseteq P\times L$, where $i =(p,l) \in I$ means that point $p$ and line $l$ are incident. The incidences can be interpreted as quadratic…
Recent results of Grepstad and Lev are used to show that weighted cut-and-project sets with one-dimensional physical space and one-dimensional internal space are bounded distance equivalent to some lattice if the weight function $h$ is…
We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…
First we explain the concept of local deformation over a 'parameter' algebra P, in particular the notion of a P-lattice in a Lie group. Purpose of this article is to define the spaces of automorphic resp. cusp forms on the upper half plane…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
Given a euclidean lattice and a curve in the corresponding projective space, our goal is to relate the height of the curve to the successive minima of the lattice. The proof of such a statement in http://hal.archves-ouvertes.vf/hal-00270564…
Decomposing a deep neural network's learned representations into interpretable features could greatly enhance its safety and reliability. To better understand features, we adopt a geometric perspective, viewing them as a learned coordinate…
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polynomially solvable. Yet, in practice, a semidefinite program is…
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…
In this paper we study sequences of lattices which are, up to similarity, projections of $\mathbb{Z}^{n+1}$ onto a hyperplane $\bm{v}^{\perp}$, with $\bm{v} \in \mathbb{Z}^{n+1}$ and converge to a target lattice $\Lambda$ which is…