Related papers: Linear precision for parametric patches

Tropical Geometry and Mathematical Morphology share the same max-plus and min-plus semiring arithmetic and matrix algebra. In this chapter we summarize some of their main ideas and common (geometric and algebraic) structure, generalize and…

In this paper we show that a surface in P^3 parametrized over a 2-dimensional toric variety T can be represented by a matrix of linear syzygies if the base points are finite in number and form locally a complete intersection. This…

In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that…

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

We give a simple analytic criterion which characterizes linearizable 1-codimensional webs. Then we give an invariant geometrical interpretation of it, in term of projective connection. We explain then how our approach allows to study…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

This paper presents rigorous forward error bounds for linear conic optimization problems. The error bounds are formulated in a quite general framework; the underlying vector spaces are not required to be finite-dimensional, and the convex…

We present an approach to detecting Zariski pairs in conic line arrangements. Our method introduces a combinatorial condition that reformulates the tubular neighborhood homeomorphism criterion arising in the definition of Zariski pairs.…

An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…

This is, mostly, a survey of results about the birational geometry of rationally connected manifolds, using rational curves analogous to lines in ${\mathbb P}^n$ ({\it quasi-lines}). Various characterizations of a Zariski neighbourhood of a…

In this paper we present an algorithm for computing a matrix representation for a surface in P^3 parametrized over a 2-dimensional toric variety T. This algorithm follows the ideas of [Botbol-Dickenstein-Dohm-09] and it was implemented in…

Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…

We briefly discuss linear algebraic, combinatorial, and applied aspects of an exact model representation of binary arrays. As an illustration, we present two linear algebraic portraits of a string of characters.

We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the…

Based on the Carath\'eodory -Pesin structure theory[11], we introduce three notions of topological pressure of a proper map and provide some properties of these notions. For the proper map of a locally compact separable metric space, we…

Imprecise continuous-time Markov chains are a robust type of continuous-time Markov chains that allow for partially specified time-dependent parameters. Computing inferences for them requires the solution of a non-linear differential…

We show that certain Graph Laplacian linear sets of equations exhibit optimal accuracy, guaranteeing that the relative error is no larger than the norm of the relative residual and that optimality occurs for carefully chosen right-hand…

This paper addresses the challenge of probabilistic parameter estimation given measurement uncertainty in real-time. We provide a general formulation and apply this to pose estimation for an autonomous visual landing system. We present…

3 pages presentation of the theory of discrete conformal parameterization using circle patterns or its linearized theory. Principal results and ideas.

In this article we develop a theory of exact linear penalty functions that generalizes and unifies most of the results on exact penalization existing in the literature. We discuss several approaches to the study of both locally and globally…