Exploració per tema "Classificació AMS::14 Algebraic geometry::14Q Computational aspects in algebraic geometry"
Ara es mostren els items 1-20 de 20
-
Algebraic phylogenetic reconstruction based on proteins and its application to Persea americana
(Universitat Politècnica de Catalunya, 2018-09)
Treball Final de Grau
Accés obertPhylogenetic reconstruction methods attempt to infer the evolutionary relationships among a group of species. Apart from classical reconstruction methods, new methods have been developed based on algebraic relationships ... -
Analysis of satellite constellations for the continuous coverage of ground regions
(2017-11-01)
Article
Accés obertThis paper studies the problem of analyzing multisatellite constellations with respect to their coverage capacity of areas on Earth’s surface. The geometric configuration of constellation projection points on Earth’s surface ... -
Cell-paths in mono- and bichromatic line arrangements in the plane
(2014)
Text en actes de congrés
Accés obertWe show that in every arrangement of n red and blue lines | in general position and not all of the same color | there is a path through a linear number of cells where red and blue lines are crossed alternatingly (and no ... -
Computing optimal shortcuts for networks
(Elsevier, 2019-11-16)
Article
Accés obertWe study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received ... -
Continuous mean distance of a weighted graph
(2022)
Text en actes de congrés
Accés obertWe study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter ... -
Effective computation of base points of two-dimensional ideals
(Universitat Politècnica de Catalunya, 2015-10)
Projecte Final de Màster Oficial
Accés obertThis works focus on computational aspects of the theory of singularities of plane algebraic curves. We show how to use the Puiseux factorization of a curve, computed through the Newton-Puiseux algorithm, to study the ... -
Geomasking through perturbation, or counting points in circles
(2017)
Text en actes de congrés
Accés restringit per política de l'editorialMotivated by a technique in privacy protection, in which n points are randomly perturbed by at most a distance r, we study the following problem: Given n points and m circles in the plane, what is the maximum r such that ... -
Graphs attaining the upper bound on the isolation number
(Universidad de Cádiz, 2023)
Text en actes de congrés
Accés obertA set D of vertices of a graph is isolating if the set of vertices not belonging to D or not having a neighbour in D is independent. The isolation number of a graph G, denoted by ¿(G), is the minimum cardinality of an ... -
Invariants, una aproximació a la filogenètica des de l'àlgebra
(2010)
Article
Accés obertEn els darrers anys, una nova aproximació a la reconstrucció filogenètica basada en tècniques provinents de l’àlgebra s’ha estat consolidant. Fixat un model evolutiu per a un conjunt donat d’espècies, els invariants són ... -
On approximating shortest paths in weighted triangular tessellations
(Springer, 2022)
Text en actes de congrés
Accés obertWe study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional ... -
On the Oß-hull of a planar point set
(2018-03-01)
Article
Accés obertWe study the Oß-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle ß. Given a set P of n points in the plane, we show how to maintain the Oß-hull of P while ... -
Rank conditions on phylogenetic networks
(Birkhäuser, 2021)
Capítol de llibre
Accés restringit per política de l'editorialLess rigid than phylogenetic trees, phylogenetic networks allow the description of a wider range of evolutionary events. In this note, we explain how to extend the rank invariants from phylogenetic trees to phylogenetic ... -
Results on the Spinc-genus
(Universitat Politècnica de Catalunya, 2020-10)
Projecte Final de Màster Oficial
Accés restringit per decisió de l'autorIn this work, we study manifolds with a Spin-c-structure, and give results on a Spin-c-genus derived from the Witten genus. We also implement codes in order to compute this genus on usual manifolds. -
Shortest paths in portalgons
(2021)
Text en actes de congrés
Accés restringit per política de l'editorial -
Spanning ratio of shortest paths in weighted square tessellations
(2022)
Text en actes de congrés
Accés restringit per política de l'editorialContinuous 2-dimensional space is often discretized by considering a grid of weighted square cells. In this work we study how well a weighted tessellation approximates the space, with respect to shortest paths. In particular, ... -
Stabbers of line segments in the plane
(2011-07)
Article
Accés obertThe problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges ... -
Tangential varieties of Segre–Veronese surfaces are never defective
(Springer, 2020-02-01)
Article
Accés obertWe compute the dimensions of all the secant varieties to the tangential varieties of all Segre–Veronese surfaces. We exploit the typical approach of computing the Hilbert function of special 0-dimensional schemes on ... -
Terrain prickliness: theoretical grounds for low complexity viewsheds
(2021)
Text en actes de congrés
Accés restringit per política de l'editorial -
The conjugacy problem in extensions of Thompson's group F
(2016-10-01)
Article
Accés obertWe solve the twisted conjugacy problem on Thompson’s group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut+(F) are orbit decidable provided a certain conjecture on Thompson’s ... -
The Kernel Matrix Diffie-Hellman Assumption
(2016-12)
Article
Accés obertWe put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix A sampled from some distribution D, the kernel assumption says that it is hard to find “in the exponent” ...