arXiv subjects

Matteo Gallet

Publications and source records attributed to Matteo Gallet.

28 records · Page 2Linked to original sources

arXiv2017

Computing the number of realizations of a Laman graph

Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion formula for this number of realizations using ideas from algebraic and tropical geometry. Here, we present a concise summary of this result focusing on the main ideas and the combinatorial point of view.

math.CO↗

arXiv2017

Varieties of apolar subschemes of toric surfaces

Powersum varieties, also called varieties of sums of powers, have provided examples of interesting relations between varieties since their first appearance in the 19th century. One of the most useful tools to study them is apolarity, a notion originally related to the action of differential operators on the polynomial ring. In this work we make explicit how one can see apolarity in terms of the Cox ring of a variety. In this way powersum varieties are a special case of varieties of apolar schemes; we explicitely describe examples of such varieties in the case of two toric surfaces, when the Cox ring is particularly well-behaved.

math.AG↗

arXiv2017

The diffeomorphism type of small hyperplane arrangements is combinatorially determined

It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7 hyperplanes and same underlying matroid are isotopic. In particular, the diffeomorphism type of the complement manifold and the Milnor fiber and fibration of these arrangements are combinatorially determined, i.e., they depend uniquely on the underlying matroid. To do this, we associate to every such matroid a topological space, that we call the reduced realization space; its connectedness, showed by means of symbolic computation, implies the desired result.

math.CO↗

arXiv2016

Planar Linkages Following a Prescribed Motion

Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a procedure for solving the problem in full generality, but his constructions tend to be extremely complicated. We provide a novel algorithm that produces much simpler linkages, but works only for parametric curves. Our approach is to transform the problem into a factorization task over some noncommutative algebra. We show how to compute such a factorization, and how to use it to construct a linkage tracing a given curve.

cs.SC↗

arXiv2016

Mobile Icosapods

Pods are mechanical devices constituted of two rigid bodies, the base and the platform, connected by a number of other rigid bodies, called legs, that are anchored via spherical joints. It is possible to prove that the maximal number of legs of a mobile pod, when finite, is 20. In 1904, Borel designed a technique to construct examples of such 20-pods, but could not constrain the legs to have base and platform points with real coordinates. We show that Borel's construction yields all mobile 20-pods, and that it is possible to construct examples with all real coordinates.

cs.RO↗

arXiv2015

On Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases

Resultants and Gröbner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study - by means of elementary tools - the difference between the multiplicity of the factors of the generator of the elimination ideal and the multiplicity of the factors of the resultant.

math.AC↗

arXiv2015

Liaison Linkages

The complete classification of hexapods - also known as Stewart Gough platforms - of mobility one is still open. To tackle this problem, we can associate to each hexapod of mobility one an algebraic curve, called the configuration curve. In this paper we establish an upper bound for the degree of this curve, assuming the hexapod is general enough. Moreover, we provide a construction of hexapods with curves of maximal degree, which is based on liaison, a technique used in the theory of algebraic curves.

cs.RO↗

arXiv2015

Ambiguities in a Problem in Planar Geodesy

This is a study of a problem in geodesy with methods from complex algebraic geometry: for a fixed number of measure points and target points at unknown position in the Euclidean plane, we study the problem of determining their relative position when the viewing angles between target points seen from measure points are known. In particular, we determine all situations in which there is more than one solution.

math.AG↗

arXiv2015

Möbius Photogrammetry

Motivated by results on the mobility of mechanical devices called pentapods, this paper deals with a mathematically freestanding problem, which we call Möbius Photogrammetry. Unlike traditional photogrammetry, which tries to recover a set of points in three-dimensional space from a finite set of central projection, we consider the problem of reconstructing a vector of points in $\mathbb{R}^3$ starting from its orthogonal parallel projections. Moreover, we assume that we have partial information about these projections, namely that we know them only up to Möbius transformations. The goal in this case is to understand to what extent we can reconstruct the starting set of points, and to prove that the result can be achieved if we allow some uncertainties in the answer. Eventually, the techniques developed in the paper allow us to show that for a pentapod with mobility at least two either some anchor points are collinear, or platform and base are similar, or they are planar and affine equivalent.

math.AG↗

arXiv2014

Bond theory for pentapods and hexapods

This paper deals with the old and classical problem of determining necessary conditions for the overconstrained mobility of some mechanical device. In particular, we show that the mobility of pentapods/hexapods implies either a collinearity condition on the anchor points, or a geometric condition on the normal projections of base and platform points. The method is based on a specific compactification of the group of direct isometries of $\mathbb{R}^3$.

cs.RO↗