Related papers: Advanced Computer Algebra for Determinants
We prove, assuming the generalized Riemann hypothesis, the Andre-Oort conjecture for Hilbert modular surfaces. More precisely, let K be a real quadratic field and let S be the coarse moduli space of complex abelian surfaces with…
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields. However, it has a worst case complexity doubly exponential in…
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…
Orbit determination (OD) from three position vectors is one of the classical problems in astrodynamics. Early contributions to this problem were made by J. Willard Gibbs in the late 1800s and OD of this type is known today as ``Gibbs…
We present constructive versions of Krull's dimension theory for commutative rings and distributive lattices. The foundations of these constructive versions are due to Joyal, Espan\~ol and the authors. We show that this gives a constructive…
A discriminant algebra operation sends a commutative ring $R$ and an $R$-algebra $A$ of rank $n$ to an $R$-algebra $\Delta_{A/R}$ of rank $2$ with the same discriminant bilinear form. Constructions of discriminant algebra operations have…
In a series of papers, George Andrews and various coauthors successfully revitalized seemingly forgotten, powerful machinery based on MacMahon's $\Omega$ operator to systematically compute generating functions $\sum_{\la \in P}…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
Three variants of Kurt G\"odel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of G\"odel's argument the two…
We work out details of the extrinsic geometry for two Hilbert schemes of some contemporary interest: the Hilbert scheme of two points on the projective plane and the dense open set parametrizing non-planar clusters in the punctual Hilbert…
We consider the Izergin-Korepin determinant [1] together with another determinant which was invented by Kuperberg [2]. He used these determinants to prove a formula for the total number of half-turn symmetric alternating sign matrices of…
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
This article evaluates the determinants of two classes of special matrices, which are both from a number theory problem. Applications of the evaluated determinants can be found in [arXiv:math.NT/0509523]. Note that the two determinants are…
In this short article, two recent beautiful proofs of George Andrews, Aviezri Fraenkel, and James Sellers, about the mod m characterization of the number of m-ary partitions are simplified and streamlined, and then generalized to handle…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…