Related papers: Linear precision for parametric patches
We classify the homogeneous polynomials in three variables whose toric polar linear system defines a Cremona transformation. This classification also includes, as a proper subset, the classification of toric surface patches from geometric…
This is a tutorial on some aspects of toric varieties related to their potential use in geometric modeling. We discuss projective toric varieties and their ideals, as well as real toric varieties and the algebraic moment map. In particular,…
We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.
In this note, we study linear determinantal representations of smooth plane cubics over finite fields. We give an explicit formula of linear determinantal representations corresponding to rational points. Using Schoof's formula, we count…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has numerous links to other fields in optimization and a wide range of application…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
We determine a strong form of the decomposition theorem for proper toric maps over finite fields.
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
We use Tannakian methods to show that patching for coherent sheaves implies patching for objects in any Noetherian algebraic stack with affine stabilizers. Among other things, this gives a straightforward way to prove patching for torsors…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
Graphical Gaussian models with edge and vertex symmetries were introduced by \citet{HojLaur:2008} who also gave an algorithm to compute the maximum likelihood estimate of the precision matrix for such models. In this paper, we take a…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
We establish a linearization criterion for skew products of contractions in any dimension. We prove their smooth or holomorphic parameter dependence. In the smooth setting, we use the language of tame Fr\'echet spaces. We apply our result…
Many problems in computer science and applied mathematics require rounding a vector $\mathbf{w}$ of fractional values lying in the interval $[0,1]$ to a binary vector $\mathbf{x}$ so that, for a given matrix $\mathbf{A}$,…
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…
Belief Propagation (BP) is a widely used approximation for exact probabilistic inference in graphical models, such as Markov Random Fields (MRFs). In graphs with cycles, however, no exact convergence guarantees for BP are known, in general.…
Rational B\'{e}zier functions are widely used as mapping functions in surface reparameterization, finite element analysis, image warping and morphing. The injectivity (one-to-one property) of a mapping function is typically necessary for…