9 research outputs found
Efficient Computation of Squarefree Separator Polynomials
Given a finite set of distinct points, a separator family is a set of polynomials, each one corresponding to a point of the given set, such that each of them takes value one at the corresponding point, whereas it vanishes at any other point of the set. Separator polynomials are fundamental building blocks for polynomial interpolation and they can be employed in several practical applications. Ceria and Mora recently developed a new algorithm for squarefree separator polynomials. The algorithm employs as a tool the point trie structure, first defined by Felszeghy-R\ue1th-R\uf3nyai in their Lex game algorithm, which gives a compact representation of the relations among the points\u2019 coordinates. In this paper, we propose a fast implementation in C of the aforementioned algorithm, based on an efficient storing and visiting of the point trie. We complete the implementation with tests on some sets of points, giving different configurations of the corresponding tries
Recommended from our members
Combinatorics
Combinatorics is a fundamental mathematical discipline that focuses on the study of discrete objects and their
properties. The present workshop featured research in such diverse areas as Extremal, Probabilistic
and Algebraic Combinatorics, Graph Theory, Discrete Geometry, Combinatorial Optimization,
Theory of Computation and Statistical Mechanics. It provided current accounts of exciting developments and challenges in these fields and a stimulating venue for a variety of fruitful interactions.
This is a report on the meeting, containing extended abstracts of the presentations and a summary of the problem session
Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints
Identifiability of data is one of the fundamental problems in data science.
Mathematically it is often formulated as the identifiability of points
satisfying a given set of algebraic relations. A key question then is to
identify sufficient conditions for observations to guarantee the
identifiability of the points.
This paper proposes a new general framework for capturing the identifiability
problem when a set of algebraic relations has a combinatorial structure and
develops tools to analyze the impact of the underlying combinatorics on the
local or global identifiability of points. Our framework is built on the
language of graph rigidity, where the measurements are Euclidean distances
between two points, but applicable in the generality of hypergraphs with
arbitrary algebraic measurements. We establish necessary and sufficient
(hyper)graph theoretical conditions for identifiability by exploiting
techniques from graph rigidity theory and algebraic geometry of secant
varieties
Quaternion Algebras
This open access textbook presents a comprehensive treatment of the arithmetic theory of quaternion algebras and orders, a subject with applications in diverse areas of mathematics. Written to be accessible and approachable to the graduate student reader, this text collects and synthesizes results from across the literature. Numerous pathways offer explorations in many different directions, while the unified treatment makes this book an essential reference for students and researchers alike. Divided into five parts, the book begins with a basic introduction to the noncommutative algebra underlying the theory of quaternion algebras over fields, including the relationship to quadratic forms. An in-depth exploration of the arithmetic of quaternion algebras and orders follows. The third part considers analytic aspects, starting with zeta functions and then passing to an idelic approach, offering a pathway from local to global that includes strong approximation. Applications of unit groups of quaternion orders to hyperbolic geometry and low-dimensional topology follow, relating geometric and topological properties to arithmetic invariants. Arithmetic geometry completes the volume, including quaternionic aspects of modular forms, supersingular elliptic curves, and the moduli of QM abelian surfaces. Quaternion Algebras encompasses a vast wealth of knowledge at the intersection of many fields. Graduate students interested in algebra, geometry, and number theory will appreciate the many avenues and connections to be explored. Instructors will find numerous options for constructing introductory and advanced courses, while researchers will value the all-embracing treatment. Readers are assumed to have some familiarity with algebraic number theory and commutative algebra, as well as the fundamentals of linear algebra, topology, and complex analysis. More advanced topics call upon additional background, as noted, though essential concepts and motivation are recapped throughout
Automated Reasoning
This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with two invited talks were carefully reviewed and selected from 85 submissions. The papers focus on the following topics: Satisfiability, SMT Solving,Arithmetic; Calculi and Orderings; Knowledge Representation and Jutsification; Choices, Invariance, Substitutions and Formalization; Modal Logics; Proofs System and Proofs Search; Evolution, Termination and Decision Prolems. This is an open access book