Related papers: Unbounded Regime for Circle Maps with a Flat Inter…
We consider here the $3$-sphere $\mathbf S^3$ seen as the boundary at infinity of the complex hyperbolic plane $\mathbf{H}^2_{\mathbf C}$. It comes equipped with a contact structure and two classes of special curves. First $\mathbf…
In this paper we consider maps on the plane which are similar to quadratic maps in that they are degree 2 branched covers of the plane. In fact, consider for $\alpha$ fixed, maps $f_c$ which have the following form (in polar coordinates):…
We consider an area-minimizing integral current of dimension $m$ and codimension at least $2$ and fix an arbitrary interior singular point $q$ where at least one tangent cone is flat. For any vanishing sequence of scales around $q$ along…
We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
We study the set of intrinsic singularities of flat affine systems with $n-1$ controls and $n$ states using the notion of Lie-B\"acklund atlas, previously introduced by the authors. For this purpose, we prove two easily computable…
What does it mean to be flat? We propose to define it by measuring the maximal variation around a point, or from a dual perspective, the distance to neighboring level sets. After developing some calculus rules, we show how flat minima,…
We obtain local boundedness and maximum principles for weak subsolutions to certain infinitely degenerate elliptic divergence form equations, and the local boundedness turns out to be sharp in more than two dimensions, answering the `Moser…
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…
We study a class of timelike weakly extremal surfaces in flat Minkowski space $\mathbb R^{1+n}$, characterized by the fact that they admit a $C^1$ parametrization (in general not an immersion) of a specific form. We prove that if the…
Quasiconformal maps in the plane are orientation preserving homeomorphisms that satisfy certain distortion inequalities; infinitesimally, they map circles to ellipses of bounded eccentricity. Such maps have many useful geometric distortion…
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…
In this manuscript, we delve into the study of maps $u\in W^{1,2}(\Omega;\overline M)$ that minimize the Alt-Caffarelli energy functional $$ \int_\Omega (|Du|^2 + q^2 \chi_{u^{-1}(M)})\,dx, $$ under the condition that the image $u(\Omega)$…
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while…
For two-parameter families of dissipative twist maps, we investigate the dynamics of invariant graphs as well as the thresholds for their existence and breakdown. Our main results are as follows: (1) For arbitrarily small $C^r$…
We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by applying round-off to planar rotations. All orbits of these maps are conjectured to be periodic. We let the angle of rotation approach pi/2, and…
We study {0,\alpha}-sets, which are sets of unit vectors of $\mathbb{C}^m$ in which any two distinct vectors have angle 0 or \alpha. We investigate some distance-regular graphs that provide new constructions of {0,\alpha}-sets using a…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the…
We study the boundary regularity of proper holomorphic mappings between strictly pseudoconvex domains with $C^2$-boundaries.