Related papers: Partial smoothness of the numerical radius at matr…
We find the exact radius of linearization disks at indifferent fixed points of quadratic maps in $\mathbb{C}_p$. We also show that the radius is invariant under power series perturbations. Localizing all periodic orbits of these…
In this paper we give a complete description about normal monohedral tilings of a convex disc with smooth boundary where we have at most three topological discs as tiles. This result is a far-reaching generalization of the results of…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
In this article, we study geometric aspects of semi-arithmetic Riemann surfaces by means of number theory and hyperbolic geometry. First, we show the existence of infinitely many semi-arithmetic Riemann surfaces of various shapes and prove…
This article mainly aims to overview the recent efforts on developing algebraic geometry for an arbitrary compact almost complex manifold. We review the results obtained by the guiding philosophy that a statement for smooth maps between…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…
The quaternionic numerical range of matrices over the ring of quaternions is not necessarily convex. We prove Toeplitz-Hausdorff like theorem, that is, for any given quaternionic matrix every section of its quaternionic numerical range is…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…
Motivated by the work of Douady, Ghys, Herman and Shishikura on Siegel quadratic polynomials, we study the one-dimensional slice of the cubic polynomials which have a fixed Siegel disk of rotation number theta, with theta being a given…
This work rests upon the certainty that only fields of real and complex numbers, quaternions and octonions have algebras of all four arithmetical operations. Also quaternions are good to represent 3-dimensional Euclid space and…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
In this paper, we prove the existence of non-radial solutions to the problem $-\triangle u=f(z,u)$, $u|_{\partial D}=0$ on the unit disc $D:=\{z\in \mathbb C : |z|<1\}$ with $u(z)\in \mathbb R^k$, where $f$ is a sub-linear continuous…
In this paper we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into ranges of vector calculus operators and complements linked to the spaces in…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…
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…
Let $\Omega$ be a smooth real analytic submanifold of a complex manifold $X$. We establish and study the link between the following 3 subjects: 1) topological properties of smooth families of attached analytic discs, the manifold $\Omega$…
We consider the problem of minimizing a smooth, Lipschitz, convex function over a compact, convex set using sub-zeroth-order oracles: an oracle that outputs the sign of the directional derivative for a given point and a given direction, an…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…