351 results on '"Tsigaridas, Elias"'
Search Results
2. Bounds on the infimum of polynomials over a generic semi-algebraic set using asymptotic critical values
- Author
-
Hilany, Boulos El and Tsigaridas, Elias
- Subjects
Mathematics - Optimization and Control ,Mathematics - Algebraic Geometry ,14Q20, 90C23, 58K15, 13P15 - Abstract
We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our bounds depend on the degree, the bitsize of $f$, and the polynomials defining $\mathscr{X}$, and are single exponential with respect to the number of variables. They generalize the single exponential bounds from Jeronimo, Perrucci, and Tsigaridas (SIAM Journal on Optimization, 23(1):241--255, 2013) for the minimum of a polynomial function on a compact connected component of a basic closed semi-algebraic set. The tools that we use allow us to obtain specialized bounds and dedicated algorithms for two large families of polynomial optimization problems in which the optimum value might not be attained. The first family forms a dense set of real polynomial functions with a fixed collection of Newton polytopes; we provide the best approximation yet for the bifurcation set, which contains the optimal value, and we deduce an effective method for computations. As for the second family, we consider any unconstrained polynomial optimization problem; we present more precise bounds, together with a better bit complexity estimate of an algorithm to compute the optimal value., Comment: 23 pages, 1 figure, 1 appendix section, comments are welcome!
- Published
- 2024
3. Multigraded Castelnuovo-Mumford regularity and Gr\'obner bases
- Author
-
Bender, Matías, Busé, Laurent, Checa, Carles, and Tsigaridas, Elias
- Subjects
Mathematics - Commutative Algebra - Abstract
We study the relation between the multigraded Castelnuovo-Mumford regularity of a multihomogeneous ideal $I$ and the multidegrees of a Gr\"obner basis of $I$ with respect to the degree reverse lexicographical monomial order in generic coordinates. For the single graded case, forty years ago, Bayer and Stillman unravelled all aspects of this relation, which in turn the use to complexity estimates for the computation with Gr\"obner bases. We build on their work to introduce a bounding region of the multidegrees of minimal generators of multigraded Gr\"obner bases for $I$. We also use this region to certify the presence of some minimal generators close to its boundary. Finally, we show that, up to a certain shift, this region is related to the multigraded Castelnuovo-Mumford regularity of $I$.
- Published
- 2024
4. Randomized Control in Performance Analysis and Empirical Asset Pricing
- Author
-
Bachelard, Cyril, Chalkis, Apostolos, Fisikopoulos, Vissarion, and Tsigaridas, Elias
- Subjects
Quantitative Finance - Portfolio Management ,Computer Science - Computational Geometry ,Quantitative Finance - Computational Finance ,G.3 - Abstract
The present article explores the application of randomized control techniques in empirical asset pricing and performance evaluation. It introduces geometric random walks, a class of Markov chain Monte Carlo methods, to construct flexible control groups in the form of random portfolios adhering to investor constraints. The sampling-based methods enable an exploration of the relationship between academically studied factor premia and performance in a practical setting. In an empirical application, the study assesses the potential to capture premias associated with size, value, quality, and momentum within a strongly constrained setup, exemplified by the investor guidelines of the MSCI Diversified Multifactor index. Additionally, the article highlights issues with the more traditional use case of random portfolios for drawing inferences in performance evaluation, showcasing challenges related to the intricacies of high-dimensional geometry., Comment: 57 pages, 7 figures, 2 tables
- Published
- 2024
5. Semidefinite network games: multiplayer minimax and semidefinite complementarity problems
- Author
-
Ickstadt, Constantin, Theobald, Thorsten, Tsigaridas, Elias, and Varvitsiotis, Antonios
- Subjects
Mathematics - Optimization and Control ,Computer Science - Computer Science and Game Theory ,52A20, 68Q25, 90C22, 91A43, 91A81 - Abstract
Network games are an important class of games that model agent interactions in networked systems, where players are situated at the nodes of a graph and their payoffs depend on the actions taken by their neighbors. We extend the classical framework by considering a game model where the strategies are positive semidefinite matrices having trace one. These (continuous) games can serve as a simple model of quantum strategic interactions. We focus on the zero-sum case, where the sum of all players' payoffs is equal to zero. We establish that in this class of games, Nash equilibria can be characterized as the projection of a spectrahedron, that is, the feasible region of a semidefinite program. Furthermore, we demonstrate that determining whether a game is a semidefinite network game is equivalent to deciding if the value of a semidefinite program is zero. Beyond the zero-sum case, we characterize Nash equilibria as the solutions of a semidefinite linear complementarity problem., Comment: 15 pages
- Published
- 2023
6. Semidefinite games
- Author
-
Ickstadt, Constantin, Theobald, Thorsten, and Tsigaridas, Elias
- Published
- 2024
- Full Text
- View/download PDF
7. One-connection rule for structural equation models
- Author
-
Adhikari, Bibhas, Gross, Elizabeth, Härkönen, Marc, and Tsigaridas, Elias
- Subjects
Mathematics - Statistics Theory ,Mathematics - Combinatorics ,62R01, 62H22 - Abstract
Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V, D,B)$ is parameterized by a rational function with parameters for each vertex and edge in $G$. This rational parametrization naturally allows for the study of these models from an algebraic and combinatorial point of view. Indeed, this point of view has led to a collection of results in the literature, mainly focusing on questions related to identifiability and determining relationships between covariances (i.e., finding polynomials in the Gaussian vanishing ideal). So far, a large proportion of these results has focused on the case when $D$, the directed part of the mixed graph $G$, is acyclic. This is due to the fact that in the acyclic case, the parametrization becomes polynomial and there is a description of the entries of the covariance matrices in terms of a finite sum. We move beyond the acyclic case and give a closed form expression for the entries of the covariance matrices in terms of the one-connections in a graph obtained from $D$ through some small operations. This closed form expression then allows us to show that if $G$ is simple, then the parametrization map is generically finite-to-one. Finally, having a closed form expression for the covariance matrices allows for the development of an algorithm for systematically exploring possible polynomials in the Gaussian vanishing ideal., Comment: 23 pages, 9 figures
- Published
- 2022
8. Computing the Non-properness Set of Real Polynomial Maps in the Plane
- Author
-
El Hilany, Boulos and Tsigaridas, Elias
- Published
- 2023
- Full Text
- View/download PDF
9. Randomized geometric tools for anomaly detection in stock markets
- Author
-
Bachelard, Cyril, Chalkis, Apostolos, Fisikopoulos, Vissarion, and Tsigaridas, Elias
- Subjects
Computer Science - Computational Geometry ,Economics - General Economics ,Statistics - Applications ,Statistics - Computation ,91-08, 91-10, 91-11, 68U99, 68-04, 62-08, 62D99, 52B11, 51-04 ,G.3 ,I.6.3 ,I.6.4 ,I.6.5 ,I.6.6 ,J.4 - Abstract
We propose novel randomized geometric tools to detect low-volatility anomalies in stock markets; a principal problem in financial economics. Our modeling of the (detection) problem results in sampling and estimating the (relative) volume of geodesically non-convex and non-connected spherical patches that arise by intersecting a non-standard simplex with a sphere. To sample, we introduce two novel Markov Chain Monte Carlo (MCMC) algorithms that exploit the geometry of the problem and employ state-of-the-art continuous geometric random walks (such as Billiard walk and Hit-and-Run) adapted on spherical patches. To our knowledge, this is the first geometric formulation and MCMC-based analysis of the volatility puzzle in stock markets. We have implemented our algorithms in C++ (along with an R interface) and we illustrate the power of our approach by performing extensive experiments on real data. Our analyses provide accurate detection and new insights into the distribution of portfolios' performance characteristics. Moreover, we use our tools to show that classical methods for low-volatility anomaly detection in finance form bad proxies that could lead to misleading or inaccurate results., Comment: 39 pages, 14 figures, 9 tables
- Published
- 2022
10. Semidefinite games
- Author
-
Ickstadt, Constantin, Theobald, Thorsten, and Tsigaridas, Elias
- Subjects
Mathematics - Optimization and Control ,Computer Science - Computer Science and Game Theory ,52A20, 90C22, 91A10 - Abstract
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite $N$-person games, by replacing the simplex of the mixed strategies for each player by a slice of the positive semidefinite cone in the space of real symmetric matrices. For semidefinite two-player zero-sum games, we show that the optimal strategies can be computed by semidefinite programming. Furthermore, we show that two-player semidefinite zero-sum games are almost equivalent to semidefinite programming, generalizing Dantzig's result on the almost equivalence of bimatrix games and linear programming. For general two-player semidefinite games, we prove a spectrahedral characterization of the Nash equilibria. Moreover, we give constructions of semidefinite games with many Nash equilibria. In particular, we give a construction of semidefinite games whose number of connected components of Nash equilibria exceeds the long standing best known construction for many Nash equilibria in bimatrix games, which was presented by von Stengel in 1999., Comment: Revised version, 28 pages
- Published
- 2022
11. On the complexity of Chow and Hurwitz forms
- Author
-
Doğan, Mahmut Levent, Ergür, Alperen Ali, and Tsigaridas, Elias
- Subjects
Computer Science - Computational Complexity ,Computer Science - Symbolic Computation ,Mathematics - Algebraic Geometry - Abstract
We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound. Earlier computational results for Chow forms were in the arithmetic complexity model, and our result represents the first bit complexity bound. We also extend our algorithm to Hurwitz forms in projective space, and explore connections between multiprojective Hurwitz forms and matroid theory. The motivation for our work comes from incidence geometry where intriguing computational algebra problems remain open.
- Published
- 2022
- Full Text
- View/download PDF
12. Beyond Worst-Case Analysis for Root Isolation Algorithms
- Author
-
Ergür, Alperen A., Tonelli-Cueto, Josué, and Tsigaridas, Elias
- Subjects
Computer Science - Computational Complexity ,Computer Science - Symbolic Computation ,Mathematics - Algebraic Geometry ,Mathematics - Probability ,65H04, 14Q20, 68W30 - Abstract
Isolating the real roots of univariate polynomials is a fundamental problem in symbolic computation and it is arguably one of the most important problems in computational mathematics. The problem has a long history decorated with numerous ingenious algorithms and furnishes an active area of research. However, the worst-case analysis of root-finding algorithms does not correlate with their practical performance. We develop a smoothed analysis framework for polynomials with integer coefficients to bridge the gap between the complexity estimates and the practical performance. In this setting, we derive that the expected bit complexity of DESCARTES solver to isolate the real roots of a polynomial, with coefficients uniformly distributed, is $\widetilde{\mathcal{O}}_B(d^2 + d \tau)$, where $d$ is the degree of the polynomial and $\tau$ the bitsize of the coefficients., Comment: 9 pages, 2 figures. 2nd version: New title, corrections. 3rd version: Correction of typo in name
- Published
- 2022
- Full Text
- View/download PDF
13. GPU-Based Homotopy Continuation for Minimal Problems in Computer Vision
- Author
-
Chien, Chiang-Heng, Fan, Hongyi, Abdelfattah, Ahmad, Tsigaridas, Elias, Tomov, Stanimire, and Kimia, Benjamin
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Systems of polynomial equations arise frequently in computer vision, especially in multiview geometry problems. Traditional methods for solving these systems typically aim to eliminate variables to reach a univariate polynomial, e.g., a tenth-order polynomial for 5-point pose estimation, using clever manipulations, or more generally using Grobner basis, resultants, and elimination templates, leading to successful algorithms for multiview geometry and other problems. However, these methods do not work when the problem is complex and when they do, they face efficiency and stability issues. Homotopy Continuation (HC) can solve more complex problems without the stability issues, and with guarantees of a global solution, but they are known to be slow. In this paper we show that HC can be parallelized on a GPU, showing significant speedups up to 26 times on polynomial benchmarks. We also show that GPU-HC can be generically applied to a range of computer vision problems, including 4-view triangulation and trifocal pose estimation with unknown focal length, which cannot be solved with elimination template but they can be efficiently solved with HC. GPU-HC opens the door to easy formulation and solution of a range of computer vision problems.
- Published
- 2021
14. Segre-Driven Radicality Testing
- Author
-
Helmer, Martin and Tsigaridas, Elias
- Subjects
Mathematics - Algebraic Geometry ,Computer Science - Computational Complexity ,Computer Science - Symbolic Computation ,Mathematics - Commutative Algebra ,14Qxx, 13Pxx, 13H15, 14C17, 14C20, 68W30, 65H10 - Abstract
We present a probabilistic algorithm to test if a homogeneous polynomial ideal $I$ defining a scheme $X$ in $\mathbb{P}^n$ is radical using Segre classes and other geometric notions from intersection theory. Its worst case complexity depends on the geometry of $X$. If the scheme $X$ has reduced isolated primary components and no embedded components supported the singular locus of $X_{\rm red}=V(\sqrt{I})$, then the worst case complexity is doubly exponential in $n$; in all the other cases the complexity is singly exponential. The realm of the ideals for which our radical testing procedure requires only single exponential time includes examples which are often considered pathological, such as the ones drawn from the famous Mayr-Meyer set of ideals which exhibit doubly exponential complexity for the ideal membership problem.
- Published
- 2021
15. Segre-driven radicality testing
- Author
-
Helmer, Martin and Tsigaridas, Elias
- Published
- 2024
- Full Text
- View/download PDF
16. Koszul-type determinantal formulas for families of mixed multilinear systems
- Author
-
Bender, Matías R., Faugère, Jean-Charles, Mantzaflaris, Angelos, and Tsigaridas, Elias
- Subjects
Mathematics - Commutative Algebra ,Computer Science - Symbolic Computation ,Mathematics - Numerical Analysis ,13P15 (Primary) 14Q20 15A18 - Abstract
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula when we can express it as a determinant of a matrix whose elements are the coefficients of the input polynomials. We study the resultant in the context of mixed multilinear polynomial systems, that is multilinear systems with polynomials having different supports, on which determinantal formulas were not known. We construct determinantal formulas for two kind of multilinear systems related to the Multiparameter Eigenvalue Problem (MEP): first, when the polynomials agree in all but one block of variables; second, when the polynomials are bilinear with different supports, related to a bipartite graph. We use the Weyman complex to construct Koszul-type determinantal formulas that generalize Sylvester-type formulas. We can use the matrices associated to these formulas to solve square systems without computing the resultant. The combination of the resultant matrices with the eigenvalue and eigenvector criterion for polynomial systems leads to a new approach for solving MEP., Comment: 29 pages, accepted for publication in SIAGA
- Published
- 2021
17. Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo
- Author
-
Chalkis, Apostolos, Fisikopoulos, Vissarion, Papachristou, Marios, and Tsigaridas, Elias
- Subjects
Computer Science - Machine Learning ,Computer Science - Computational Geometry - Abstract
We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm, to sample from a log-concave distribution restricted to a convex body. We prove that, starting from a warm start, the walk mixes to a log-concave target distribution $\pi(x) \propto e^{-f(x)}$, where $f$ is $L$-smooth and $m$-strongly-convex, within accuracy $\varepsilon$ after $\widetilde O(\kappa d^2 \ell^2 \log (1 / \varepsilon))$ steps for a well-rounded convex body where $\kappa = L / m$ is the condition number of the negative log-density, $d$ is the dimension, $\ell$ is an upper bound on the number of reflections, and $\varepsilon$ is the accuracy parameter. We also developed an efficient open source implementation of ReHMC and we performed an experimental study on various high-dimensional data-sets. The experiments suggest that ReHMC outperfroms Hit-and-Run and Coordinate-Hit-and-Run regarding the time it needs to produce an independent sample and introduces practical truncated sampling in thousands of dimensions., Comment: There is an issue with the support of the distribution of Lemma 6 that affects the mixing time bound
- Published
- 2021
- Full Text
- View/download PDF
18. Computing the non-properness set of real polynomial maps in the plane
- Author
-
Hilany, Boulos El and Tsigaridas, Elias
- Subjects
Mathematics - Algebraic Geometry ,12D10, 14P10, 14R25, 26C05, 52B20 - Abstract
We introduce novel mathematical and computational tools to develop a complete algorithm for computing the set of non-properness of polynomials maps in the plane. In particular, this set, which we call \emph{the Jelonek set}, is a subset of $\mathbb{K}^2$ where a dominant polynomial map $f:\mathbb{K}^2\to\mathbb{K}^2$ is not proper; $\mathbb{K}$ could be either $\mathbb{C}$ or $\mathbb{R}$. Unlike all the previously known approaches we make no assumptions on $f$ whenever $\mathbb{K} = \mathbb{R}$; this is the first algorithm with this property. The algorithm takes into account the Newton polytopes of the polynomials. As a byproduct we provide a finer representation of the set of non-properness as a union of semi-algebraic curves, that correspond to edges of the Newton polytopes, which is of independent interest. Finally, we present a precise Boolean complexity analysis of the algorithm and a prototype implementation in Maple., Comment: Major revision made. To appear in Vietnam Journal of Mathematics. 32 pages, 5 figures, comments are welcome!
- Published
- 2021
19. PTOPO: Computing the Geometry and the Topology of Parametric Curves
- Author
-
Katsamaki, Christina, Rouillier, Fabrice, and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space. Our method exploits the benefits of the parametric representation and does not resort to implicitization. Most importantly, we perform all computations in the parameter space and not in the implicit space. When the parametrization involves polynomials of degree at most $d$ and maximum bitsize of coefficients $\tau$, then the worst case bit complexity of PTOPO is $ \tilde{\mathcal{O}}_B(nd^6+nd^5\tau+d^4(n^2+n\tau)+d^3(n^2\tau+ n^3)+n^3d^2\tau)$. This bound matches the current record bound $\tilde{\mathcal{O}}_B(d^6+d^5\tau)$ for the problem of computing the topology of a plane algebraic curve given in implicit form. For plane and space curves, if $N = \max\{d, \tau \}$, the complexity of PTOPO becomes $\tilde{\mathcal{O}}_B(N^6)$, which improves the state-of-the-art result, due to Alc\'azar and D\'iaz-Toca [CAGD'10], by a factor of $N^{10}$. In the same time complexity, we obtain a graph whose straight-line embedding is isotopic to the curve. However, visualizing the curve on top of the abstract graph construction, increases the bound to $\tilde{\mathcal{O}}_B(N^7)$. For curves of general dimension, we can also distinguish between ordinary and non-ordinary real singularities and determine their multiplicities in the same expected complexity of PTOPO by employing the algorithm of Blasco and P\'erez-D\'iaz [CAGD'19]. We have implemented PTOPO in Maple for the case of plane and space curves. Our experiments illustrate its practical nature.
- Published
- 2021
20. Geometric algorithms for sampling the flux space of metabolic networks
- Author
-
Chalkis, Apostolos, Fisikopoulos, Vissarion, Tsigaridas, Elias, and Zafeiropoulos, Haris
- Subjects
Quantitative Biology - Quantitative Methods ,Computer Science - Computational Geometry ,Quantitative Biology - Molecular Networks - Abstract
Systems Biology is a fundamental field and paradigm that introduces a new era in Biology. The crux of its functionality and usefulness relies on metabolic networks that model the reactions occurring inside an organism and provide the means to understand the underlying mechanisms that govern biological systems. Even more, metabolic networks have a broader impact that ranges from resolution of ecosystems to personalized medicine.The analysis of metabolic networks is a computational geometry oriented field as one of the main operations they depend on is sampling uniformly points from polytopes; the latter provides a representation of the steady states of the metabolic networks. However, the polytopes that result from biological data are of very high dimension (to the order of thousands) and in most, if not all, the cases are considerably skinny. Therefore, to perform uniform random sampling efficiently in this setting, we need a novel algorithmic and computational framework specially tailored for the properties of metabolic networks.We present a complete software framework to handle sampling in metabolic networks. Its backbone is a Multiphase Monte Carlo Sampling (MMCS) algorithm that unifies rounding and sampling in one pass, obtaining both upon termination. It exploits an improved variant of the Billiard Walk that enjoys faster arithmetic complexity per step. We demonstrate the efficiency of our approach by performing extensive experiments on various metabolic networks. Notably, sampling on the most complicated human metabolic network accessible today, Recon3D, corresponding to a polytope of dimension 5 335 took less than 30 hours. To our knowledge, that is out of reach for existing software., Comment: The 37th International Symposium on Computational Geometry (SoCG), Jun 2021, Buffalo, United States
- Published
- 2020
21. Exact solutions in low-rank approximation with zeros
- Author
-
Kubjas, Kaie, Sodomaco, Luca, and Tsigaridas, Elias
- Subjects
Mathematics - Algebraic Geometry ,Mathematics - Optimization and Control ,14M12, 14P05, 13P25, 90C26, 68W30 - Abstract
Low-rank approximation with zeros aims to find a matrix of fixed rank and with a fixed zero pattern that minimizes the Euclidean distance to a given data matrix. We study the critical points of this optimization problem using algebraic tools. In particular, we describe special linear, affine, and determinantal relations satisfied by the critical points. We also investigate the number of critical points and how this number is related to the complexity of nonnegative matrix factorization problem., Comment: revised version to appear on Linear Algebra and its Applications, 26 pages, 1 figure, 8 tables
- Published
- 2020
- Full Text
- View/download PDF
22. Efficient Sampling from Feasible Sets of SDPs and Volume Approximation
- Author
-
Chalkis, Apostolos, Emiris, Ioannis, Fisikopoulos, Vissarion, Repouskos, Panagiotis, and Tsigaridas, Elias
- Subjects
Computer Science - Computational Geometry - Abstract
We present algorithmic, complexity, and implementation results on the problem of sampling points from a spectrahedron, that is the feasible region of a semidefinite program. Our main tool is geometric random walks. We analyze the arithmetic and bit complexity of certain primitive geometric operations that are based on the algebraic properties of spectrahedra and the polynomial eigenvalue problem. This study leads to the implementation of a broad collection of random walks for sampling from spectrahedra that experimentally show faster mixing times than methods currently employed either in theoretical studies or in applications, including the popular family of Hit-and-Run walks. The different random walks offer a variety of advantages , thus allowing us to efficiently sample from general probability distributions, for example the family of log-concave distributions which arise in numerous applications. We focus on two major applications of independent interest: (i) approximate the volume of a spectrahedron, and (ii) compute the expectation of functions coming from robust optimal control. We exploit efficient linear algebra algorithms and implementations to address the aforemen-tioned computations in very high dimension. In particular, we provide a C++ open source implementation of our methods that scales efficiently, for the first time, up to dimension 200. We illustrate its efficiency on various data sets.
- Published
- 2020
23. Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces
- Author
-
Tonelli-Cueto, Josué and Tsigaridas, Elias
- Subjects
Computer Science - Computational Geometry ,Mathematics - Numerical Analysis ,14Q20, 65D18, 65Y20 ,G.0 ,I.1.2 ,F.2.1 - Abstract
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials that we can handle. Despite important recent progress, the available tools cannot handle random sparse polynomials and Gaussian polynomials, that is polynomials whose coefficients are i.i.d. Gaussian random variables. We initiate a condition-based complexity framework based on the norm of the cube that is a step in this direction. We present this framework for real hypersurfaces and univariate polynomials. We demonstrate its capabilities in two problems, under very mild probabilistic assumptions. On the one hand, we show that the average run-time of the Plantinga-Vegter algorithm is polynomial in the degree for random sparse (alas a restricted sparseness structure) polynomials and random Gaussian polynomials. On the other hand, we study the size of the subdivision tree for Descartes' solver and run-time of the solver by Jindal and Sagraloff (arXiv:1704.06979). In both cases, we provide a bound that is polynomial in the size of the input (size of the support plus the logarithm of the degree) not only for the average but also for all higher moments., Comment: 34 pages. Version 1, conference version; from version 2, journal version
- Published
- 2020
- Full Text
- View/download PDF
24. The Multivariate Schwartz-Zippel Lemma
- Author
-
Doğan, M. Levent, Ergür, Alperen A., Mundo, Jake D., and Tsigaridas, Elias
- Subjects
Mathematics - Combinatorics ,Computer Science - Computational Geometry ,Computer Science - Symbolic Computation ,Mathematics - Algebraic Geometry ,P52C10, 12D10 - Abstract
Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite sets, and let $S:=S_1 \times S_2 \times \ldots \times S_m \subset \mathbb{C}^n$ be the multi-grid defined by $S_i$. Suppose $p$ is an $n$-variate degree $d$ polynomial. How many zeros does $p$ have on $S$? We first develop a multivariate generalization of Combinatorial Nullstellensatz that certifies existence of a point $t \in S$ so that $p(t) \neq 0$. Then we show that a natural multivariate generalization of the DeMillo-Lipton-Schwartz-Zippel lemma holds, except for a special family of polynomials that we call $\lambda$-reducible. This yields a simultaneous generalization of Szemer\'edi-Trotter theorem and Schwartz-Zippel lemma into higher dimensions, and has applications in incidence geometry. Finally, we develop a symbolic algorithm that identifies certain $\lambda$-reducible polynomials. More precisely, our symbolic algorithm detects polynomials that include a cartesian product of hypersurfaces in their zero set. It is likely that using Chow forms the algorithm can be generalized to handle arbitrary $\lambda$-reducible polynomials, which we leave as an open problem., Comment: Added a few elementary lemmas to improve readability, and fixed a mistake in a proof in the previous version. We spotted the mistake after a question of Joshua Zahl, and very thankful for his question. The paper is to appear in SIAM Journal of Discrete Mathematics
- Published
- 2019
- Full Text
- View/download PDF
25. Trifocal Relative Pose from Lines at Points and its Efficient Solution
- Author
-
Fabbri, Ricardo, Duff, Timothy, Fan, Hongyi, Regan, Margaret, de Pinho, David da Costa, Tsigaridas, Elias, Wampler, Charles, Hauenstein, Jonathan, Kimia, Benjamin, Leykin, Anton, and Pajdla, Tomas
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,14Qxx, 12Yxx, 51N15, 14N05, 53A20, 17B81, 22E70, 53A04, 53A55, 53Bxx, 53B5, 57R25, 58C25, 68T40, 68U05, 70B1, 70G55, 70G65, 90C30 ,I.4.5 ,I.4.8 ,I.2.9 ,I.2.10 ,I.1.2 ,G.1.3 ,G.1.5 - Abstract
We present a method for solving two minimal problems for relative camera pose estimation from three views, which are based on three view correspondences of i) three points and one line and the novel case of ii) three points and two lines through two of the points. These problems are too difficult to be efficiently solved by the state of the art Groebner basis methods. Our method is based on a new efficient homotopy continuation (HC) solver framework MINUS, which dramatically speeds up previous HC solving by specializing HC methods to generic cases of our problems. We characterize their number of solutions and show with simulated experiments that our solvers are numerically robust and stable under image noise, a key contribution given the borderline intractable degree of nonlinearity of trinocular constraints. We show in real experiments that i) SIFT feature location and orientation provide good enough point-and-line correspondences for three-view reconstruction and ii) that we can solve difficult cases with too few or too noisy tentative matches, where the state of the art structure from motion initialization fails., Comment: First appeared at CVPR - Computer Vision and Pattern Recognition Conference 2020. This material is based upon work supported by the National Science Foundation under Grant No. DMS-1439786 while most authors were in residence at Brown University's Institute for Computational and Experimental Research in Mathematics -- ICERM, in Providence, RI
- Published
- 2019
26. Gr{\'o}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
- Author
-
Bender, Matías, Faugère, Jean-Charles, and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases, the polynomial systems coming from applications have some kind of structure. For example , several problems in computer-aided design, robotics, vision, biology , kinematics, cryptography, and optimization involve sparse systems where the input polynomials have a few non-zero terms. Our approach to exploit sparsity is to embed the systems in a semigroup algebra and to compute Gr{\"o}bner bases over this algebra. Up to now, the algorithms that follow this approach benefit from the sparsity only in the case where all the polynomials have the same sparsity structure, that is the same Newton polytope. We introduce the first algorithm that overcomes this restriction. Under regularity assumptions, it performs no redundant computations. Further, we extend this algorithm to compute Gr{\"o}bner basis in the standard algebra and solve sparse polynomials systems over the torus $(C*)^n$. The complexity of the algorithm depends on the Newton polytopes.
- Published
- 2019
27. Computing the topology of a planar or space hyperelliptic curve
- Author
-
Alcázar, Juan Gerardo, Caravantes, Jorge, Diaz-Toca, Gema M., and Tsigaridas, Elias
- Subjects
Mathematics - Geometric Topology ,Computer Science - Symbolic Computation ,14H50 - Abstract
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose topology is easy to compute, under a birational mapping of the plane or the space. We report on a {\tt Maple} implementation of these algorithms, and present several examples. Complexity and certification issues are also discussed., Comment: 34 pages, lot of figures
- Published
- 2018
28. On the maximal number of real embeddings of minimally rigid graphs in $\mathbb{R}^2$, $\mathbb{R}^3$ and $S^2$
- Author
-
Bartzos, Evangelos, Emiris, Ioannis Z., Legerský, Jan, and Tsigaridas, Elias
- Subjects
Mathematics - Algebraic Geometry ,Mathematics - Combinatorics ,Mathematics - Metric Geometry ,52C25, 13P15, 68W30 - Abstract
Rigidity theory studies the properties of graphs that can have rigid embeddings in a euclidean space $\mathbb{R}^d$ or on a sphere and which in addition satisfy certain edge length constraints. One of the major open problems in this field is to determine lower and upper bounds on the number of realizations with respect to a given number of vertices. This problem is closely related to the classification of rigid graphs according to their maximal number of real embeddings. In this paper, we are interested in finding edge lengths that can maximize the number of real embeddings of minimally rigid graphs in the plane, space, and on the sphere. We use algebraic formulations to provide upper bounds. To find values of the parameters that lead to graphs with a large number of real realizations, possibly attaining the (algebraic) upper bounds, we use some standard heuristics and we also develop a new method inspired by coupler curves. We apply this new method to obtain embeddings in $\mathbb{R}^3$. One of its main novelties is that it allows us to sample efficiently from a larger number of parameters by selecting only a subset of them at each iteration. Our results include a full classification of the 7-vertex graphs according to their maximal numbers of real embeddings in the cases of the embeddings in $\mathbb{R}^2$ and $\mathbb{R}^3$, while in the case of $S^2$ we achieve this classification for all 6-vertex graphs. Additionally, by increasing the number of embeddings of selected graphs, we improve the previously known asymptotic lower bound on the maximum number of realizations. The methods and the results concerning the spatial embeddings are part of the proceedings of ISSAC 2018 (Bartzos et al, 2018).
- Published
- 2018
- Full Text
- View/download PDF
29. A nearly optimal algorithm to decompose binary forms
- Author
-
Bender, Matías, Faugère, Jean-Charles, Perret, Ludovic, and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous polynomials, that is to write a homogeneous polynomial in n variables of degree D as a sum of D-th powers of linear forms, using the minimal number of summands. This minimal number is called the rank of the polynomial/tensor. We focus on decomposing binary forms, a problem that corresponds to the decomposition of symmetric tensors of dimension 2 and order D. Under this formulation, the problem finds its roots in invariant theory where the decompositions are known as canonical forms. In this context many different algorithms were proposed. We introduce a superfast algorithm that improves the previous approaches with results from structured linear algebra. It achieves a softly linear arithmetic complexity bound. To the best of our knowledge, the previously known algorithms have at least quadratic complexity bounds. Our algorithm computes a symbolic decomposition in $O(M(D) log(D))$ arithmetic operations, where $M(D)$ is the complexity of multiplying two polynomials of degree D. It is deterministic when the decomposition is unique. When the decomposition is not unique, our algorithm is randomized. We present a Monte Carlo version of it and we show how to modify it to a Las Vegas one, within the same complexity. From the symbolic decomposition, we approximate the terms of the decomposition with an error of $2^{--$\epsilon$}$ , in $O(D log^2(D) (log^2(D) + log($\epsilon$)))$ arithmetic operations. We use results from Kaltofen and Yagati (1989) to bound the size of the representation of the coefficients involved in the decomposition and we bound the algebraic degree of the problem by min(rank, D -- rank + 1). We show that this bound can be tight. When the input polynomial has integer coefficients, our algorithm performs, up to poly-logarithmic factors, $O\_{bit} (D{\ell} + D^4 + D^3 $\tau$)$ bit operations, where $$\tau$$ is the maximum bitsize of the coefficients and $2^{--{\ell}}$ is the relative error of the terms in the decomposition., Comment: Accepted to JSC
- Published
- 2018
30. Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- Author
-
Tonelli-Cueto, Josué and Tsigaridas, Elias
- Published
- 2023
- Full Text
- View/download PDF
31. PTOPO: Computing the geometry and the topology of parametric curves
- Author
-
Katsamaki, Christina, Rouillier, Fabrice, Tsigaridas, Elias, and Zafeirakopoulos, Zafeirakis
- Published
- 2023
- Full Text
- View/download PDF
32. Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors
- Author
-
Bender, Matías, Faugère, Jean-Charles, Mantzaflaris, Angelos, and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials up-to sign. This problem is well understood for unmixed multihomogeneous systems, that is for systems consisting of multihomogeneous polynomials with the * 1 same support. However, little is known for mixed systems, that is for systems consisting of polynomials with different supports. We consider the computation of the multihomogeneous resultant of bilinear systems involving two different supports. We present a constructive approach that expresses the resultant as the exact determinant of a Koszul resultant matrix, that is a matrix constructed from maps in the Koszul complex. We exploit the resultant matrix to propose an algorithm to solve such systems. In the process we extend the classical eigenvalues and eigenvectors criterion to a more general setting. Our extension of the eigenvalues criterion applies to a general class of matrices, including the Sylvester-type and the Koszul-type ones., Comment: Proceedings of the 43th International Symposium on Symbolic and Algebraic Computation, 2018, Jul 2018, New York, United States. 2018
- Published
- 2018
- Full Text
- View/download PDF
33. Towards Mixed Gr{\'o}bner Basis Algorithms: the Multihomogeneous and Sparse Case
- Author
-
Bender, Matías, Faugère, Jean-Charles, and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of unmixed polynomial systems, that is systems with polynomials having the same support, using the approach of Faug{\`e}re, Spaenlehauer, and Svartz [ISSAC'14]. We present two algorithms for sparse Gr{\"o}bner bases computations for mixed systems. The first one computes with mixed sparse systems and exploits the supports of the polynomials. Under regularity assumptions, it performs no reductions to zero. For mixed, square, and 0-dimensional multihomogeneous polynomial systems, we present a dedicated, and potentially more efficient, algorithm that exploits different algebraic properties that performs no reduction to zero. We give an explicit bound for the maximal degree appearing in the computations.
- Published
- 2018
- Full Text
- View/download PDF
34. On the maximal number of real embeddings of spatial minimally rigid graphs
- Author
-
Bartzos, Evangelos, Emiris, Ioannis, Legerský, Jan, and Tsigaridas, Elias
- Subjects
Mathematics - Algebraic Geometry ,Mathematics - Combinatorics ,52C25, 13P15, 68W30 - Abstract
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap between upper and lower bounds is still enormous. Specific values and its asymptotic behavior are major and fascinating open problems in rigidity theory. Our work considers the maximal number of real embeddings of minimally rigid graphs in $\mathbb{R}^3$. We modify a commonly used parametric semi-algebraic formulation that exploits the Cayley-Menger determinant to minimize the {\em a priori} number of complex embeddings, where the parameters correspond to edge lengths. To cope with the huge dimension of the parameter space and find specializations of the parameters that maximize the number of real embeddings, we introduce a method based on coupler curves that makes the sampling feasible for spatial minimally rigid graphs. Our methodology results in the first full classification of the number of real embeddings of graphs with 7 vertices in $\mathbb{R}^3$, which was the smallest open case. Building on this and certain 8-vertex graphs, we improve the previously known general lower bound on the maximum number of real embeddings in $\mathbb{R}^3$.
- Published
- 2018
- Full Text
- View/download PDF
35. The Complexity of Subdivision for Diameter-Distance Tests
- Author
-
Burr, Michael, Gao, Shuhong, and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation ,68W30, 65Y20 - Abstract
We present a general framework for analyzing the complexity of subdivision-based algorithms whose tests are based on the sizes of regions and their distance to certain sets (often varieties) intrinsic to the problem under study. We call such tests diameter-distance tests. We illustrate that diameter-distance tests are common in the literature by proving that many interval arithmetic-based tests are, in fact, diameter-distance tests. For this class of algorithms, we provide both non-adaptive bounds for the complexity, based on separation bounds, as well as adaptive bounds, by applying the framework of continuous amortization. Using this structure, we provide the first complexity analysis for the algorithm by Plantinga and Vegeter for approximating real implicit curves and surfaces. We present both adaptive and non-adaptive a priori worst-case bounds on the complexity of this algorithm both in terms of the number of subregions constructed and in terms of the bit complexity for the construction. Finally, we construct families of hypersurfaces to prove that our bounds are tight.
- Published
- 2018
36. Lower bounds on the number of realizations of rigid graphs
- Author
-
Grasegger, Georg, Koutschan, Christoph, and Tsigaridas, Elias
- Subjects
Mathematics - Combinatorics ,Computer Science - Computational Geometry ,Computer Science - Symbolic Computation ,52C25, 05C04, 68W30 - Abstract
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available method, although its complexity is still exponential. Combining computational results with the theory of constructing new rigid graphs by gluing, we give a new lower bound on the maximal possible number of (complex) realizations for graphs with a given number of vertices. We extend these ideas to rigid graphs in three dimensions and we derive similar lower bounds, by exploiting data from extensive Gr\"obner basis computations.
- Published
- 2017
- Full Text
- View/download PDF
37. Efficient sampling in spectrahedra and volume approximation
- Author
-
Chalkis, Apostolos, Emiris, Ioannis Z., Fisikopoulos, Vissarion, Repouskos, Panagiotis, and Tsigaridas, Elias
- Published
- 2022
- Full Text
- View/download PDF
38. Exact solutions in low-rank approximation with zeros
- Author
-
Kubjas, Kaie, Sodomaco, Luca, and Tsigaridas, Elias
- Published
- 2022
- Full Text
- View/download PDF
39. Randomized Control in Performance Analysis and Empirical Asset Pricing
- Author
-
Chalkis, Apostolos, primary, Bachelard, Cyril, additional, Fisikopoulos, Vissarion, additional, and Tsigaridas, Elias, additional
- Published
- 2024
- Full Text
- View/download PDF
40. Multilinear polynomial systems: Root isolation and bit complexity
- Author
-
Emiris, Ioannis Z., Mantzaflaris, Angelos, and Tsigaridas, Elias P.
- Published
- 2021
- Full Text
- View/download PDF
41. A nearly optimal algorithm to decompose binary forms
- Author
-
Bender, Matías R., Faugère, Jean-Charles, Perret, Ludovic, and Tsigaridas, Elias
- Published
- 2021
- Full Text
- View/download PDF
42. On the maximal number of real embeddings of minimally rigid graphs in [formula omitted], [formula omitted] and S2
- Author
-
Bartzos, Evangelos, Emiris, Ioannis Z., Legerský, Jan, and Tsigaridas, Elias
- Published
- 2021
- Full Text
- View/download PDF
43. Accelerated Approximation of the Complex Roots and Factors of a Univariate Polynomial
- Author
-
Pan, Victor Y., Tsigaridas, Elias P., Zaderman, Vitaly, and Zhao, Liang
- Subjects
Computer Science - Symbolic Computation - Abstract
The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes numerical stability problems when the degree is large. We observe, however, that such a difficulty disappears at the initial stage of the algorithms, and in our present paper we extend this stage to root-finding within a nearly optimal arithmetic and Boolean complexity bounds provided that some mild initial isolation of the roots of the input polynomial has been ensured. Furthermore our algorithm is nearly optimal for the approximation of the roots isolated in a fixed disc, square or another region on the complex plane rather than all complex roots of a polynomial. Moreover the algorithm can be applied to a polynomial given by a black box for its evaluation (even if its coefficients are not known); it promises to be of practical value for polynomial root-finding and factorization, the latter task being of interest on its own right. We also provide a new support for a winding number algorithm, which enables extension of our progress to obtaining mild initial approximations to the roots. We conclude with summarizing our algorithms and their extension to the approximation of isolated multiple roots and root clusters., Comment: 16 pages
- Published
- 2015
44. Separation bounds for polynomial systems
- Author
-
Emiris, Ioannis, Mourrain, Bernard, and Tsigaridas, Elias
- Published
- 2020
- Full Text
- View/download PDF
45. The complexity of subdivision for diameter-distance tests
- Author
-
Burr, Michael, Gao, Shuhong, and Tsigaridas, Elias
- Published
- 2020
- Full Text
- View/download PDF
46. Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- Author
-
Busé, Laurent, Mantzaflaris, Angelos, and Tsigaridas, Elias
- Published
- 2020
- Full Text
- View/download PDF
47. Computing the topology of a plane or space hyperelliptic curve
- Author
-
Alcázar, Juan Gerardo, Caravantes, Jorge, Diaz-Toca, Gema M., and Tsigaridas, Elias
- Published
- 2020
- Full Text
- View/download PDF
48. On the Complexity of Chow and Hurwitz Forms
- Author
-
Dogan, M. Levent, primary, Ergür, Alperen A., additional, and Tsigaridas, Elias, additional
- Published
- 2023
- Full Text
- View/download PDF
49. Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract)
- Author
-
Pan, Victor Y. and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an area of active research. By combining some powerful techniques developed in this area we devise new nearly optimal algorithms, whose substantial merit is their simplicity, important for the implementation., Comment: (10/04/2014)
- Published
- 2014
50. Nearly Optimal Computations with Structured Matrices
- Author
-
Pan, Victor Y. and Tsigaridas, Elias
- Subjects
Computer Science - Symbolic Computation - Abstract
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel, Cauchy and Van-der-monde matrices, for which the cited computational problems are equivalent to the task of polynomial multiplication and division and polynomial and rational multipoint evaluation and interpolation. The Boolean cost estimates for the latter problems have been obtained by Kirrinnis in \cite{kirrinnis-joc-1998}, except for rational interpolation, which we supply now. All known Boolean cost estimates for these problems rely on using Kronecker product. This implies the $d$-fold precision increase for the $d$-th degree output, but we avoid such an increase by relying on distinct techniques based on employing FFT. Furthermore we simplify the analysis and make it more transparent by combining the representation of our tasks and algorithms in terms of both structured matrices and polynomials and rational functions. This also enables further extensions of our estimates to cover Trummer's important problem and computations with the popular classes of structured matrices that generalize the four cited basic matrix classes., Comment: (2014-04-10)
- Published
- 2014
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.