An official website of the United States government
Two new efficient algorithms for computing greatest common divisors (gcds) of parametric multivariate polynomials over k[U][X]are presented. The key idea of the first algorithm is that the gcd of two non-parametric multivariate polynomials can be obtained by dividing their product by the generator of the intersection of two principal ideals generated by the polynomials. The second algorithm is based on another simple insight that the gcd can be extracted using the generator of the ideal quotient of a polynomial with respect to the second polynomial. Since the ideal intersection and ideal quotient in these cases are also principal ideals, their generators can be obtained by computing minimal Gröbner bases of the ideal intersection and ideal quotient, respectively. To avoid introducing new variables which can adversely affect the efficiency, minimal Gröbner bases computations are performed on modules. Both of these constructions generalize to the parametric case as shown in the paper. Comprehensive Gröbner system constructions are used for the parametric ideal intersection and ideal quotient using the Kapur-Sun-Wang’s algorithm. It is proved that whether in a minimal comprehensive Gröbner system of a parametric ideal 20intersection or in that of a parametric ideal quotient, each branch of the specializations corresponds to a principal parametric ideal with a single generator. Using this generator, the parametric gcd of that branch is obtained by division. For the case of more than two parametric polynomials, we can use the above two algorithms to compute gcds recursively, and get an extended algorithm by generalizing the idea of the second algorithm. Algorithms do not suffer from having to apply expensive steps such as ensuring whether parametric polynomials are primitive w.r.t. the main variable as used in both the algorithms proposed by Nagasaka (ISSAC, 2017). The resulting algorithms are not only conceptually simple to understand but are more efficient in practice. The proposed algorithms and both of Nagasaka’s algorithms have been implemented in Singular, and their performance is compared on a number of examples.
more »
« less
A census of exceptional Dehn fillings
This dataset gives the complete list of all 205,822 exceptional Dehn fillings on the 1-cusped hyperbolic 3-manifolds that have ideal triangulations with at most 9 ideal tetrahedra.
more »
« less
- Award ID(s):
- 1811156
- PAR ID:
- 10414475
- Publisher / Repository:
- Harvard Dataverse
- Date Published:
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We introduce a notion of sectional regularity for a homogeneous ideal I, which measures the regularity of its general sections with respect to linear spaces of various dimensions. It is related to axial constants defined as the intercepts on the coordinate axes of the set of exponents of monomials in the reverse lexicographic generic initial ideal of I. We show the equivalence of these notions and several other homological and ideal-theoretic invariants. We also establish that these equivalent invariants grow linearly for the family of powers of a given ideal.more » « less
-
Abstract Spatial voting models are widely used in political science to analyze legislators’ preferences and voting behavior. Traditional models assume that legislators’ ideal points are static across different types of votes. This article extends the Bayesian spatial voting model to incorporate hierarchical Bayesian methods, allowing for the identification of covariates that explain differences in legislators’ ideal points across voting domains. We apply this model to procedural and final passage votes in the U.S. House of Representatives from the 93rd through 113th Congresses. Our findings indicate that legislators in the minority party and those representing moderate constituencies are more likely to exhibit different ideal points between procedural and final passage votes. This research advances the methodology of ideal point estimation by simultaneously scaling ideal points and explaining variation in these points, providing a more nuanced understanding of legislative voting behavior.more » « less
-
null (Ed.)The microscopic properties that determine hygroscopic behavior are complex. The importance of hygroscopicity to many areas, and particularly atmospheric chemistry, in terms of aerosol growth and cloud nucleation, mandate the need for robust models to understand this behavior. Toward this end, we have employed molecular dynamics simulations to calculate hygroscopicity from atomistic models using free energy perturbation. We find that currently available force fields may not be well-suited to modeling the extreme environments of aerosol particles. Nonetheless, the results illuminate some shortcomings in our current understanding of hygroscopic growth and cloud nucleation. The most widely used model of hygroscopicity, κ-Köhler Theory (κKT), breaks down in the case of deviations from ideal solution behavior and empirical adjustments within the simplified framework cannot account for non-ideal behavior. A revised model that incorporates non-ideal mixing rescues the general framework of κKT and allows us to understand our simulation results as well as the behavior of atmospheric aerosols over the full range of humidity. The revised model shows that non-ideal mixing dominates hygroscopic growth at subsaturation humidity. Thus, a model based on ideal mixing will fail to predict subsaturation growth from cloud condensation nucleus (CCN) activation or vice versa ; a single parameter model for hygroscopicity will generally be insufficient to extrapolate across wide ranges of humidity. We argue that in many cases, when data are limited to subsaturation humidity, an empirical model for non-ideal mixing may be more successful than one for ideal mixing.more » « less
