Related papers: Etienne B\'ezout on Elimination Theory

Jacques Tits gave a general recipe for producing an abstract geometry from a semisimple algebraic group. This expository paper describes a uniform method for giving a concrete realization of Tits's geometry and works through several…

An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value…

Gordon introduced a class of matroids $M(n)$, for prime $n\ge 2$, such that $M(n)$ is algebraically representable, but only in characteristic $n$. Lindstr\"om proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if…

According to the basic idea of category theory, any Einstein algebra, essentially an algebraic formulation of general relativity, can be considered from the point of view of any object of the category of smooth algebras; such an object is…

Based on the reduction of degree in polynomial mappings and some known results in algebraic geometry, by introducing the Brouwer degree, a tool from differential topology, algebraic topology and algebraic geometry, we completely prove the…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

The {\em abeliant} is a polynomial rule for producing an $n$ by $n$ matrix with entries in a given ring from an $n$ by $n$ by $n+2$ array of elements of that ring. The theory of abeliants, first introduced in an earlier paper of the author,…

The Constant Degree Hypothesis was introduced by Barrington et. al. (1990) to study some extensions of $q$-groups by nilpotent groups and the power of these groups in a certain computational model. In its simplest formulation, it…

Bousquet-M\'elou & Eriksson's lecture hall theorem generalizes Euler's celebrated distinct-odd partition theorem. We present an elementary and transparent proof of a refined version of the lecture hall theorem using a simple bijection…

In 1982, Tamaki Yano proposed a conjecture predicting the set of b-exponents of an irreducible plane curve singularity germ which is generic in its equisingularity class. In \cite{ACLM-Yano2} we proved the conjecture for the case in which…

We present a Bayesian method for the identification and classification of objects from sets of astronomical catalogs, given a predefined classification scheme. Identification refers here to the association of entries in different catalogs…

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

In the 1970s Alain Connes identified the appropriate notion of amenabilty for von Neumann algebras, and used it to obtain a deep internal finite dimensional approximation structure for these algebras. This structure is exactly what is…

Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra $\mathbb{B}$ of finite rank…

The Gordon--Rodriguez-Villegas theorem says that, in a finite group, the number of solutions to a system of coefficient-free equations is divisible by the order of the group if the rank of the matrix composed of the exponent sums of $j$-th…

Rigid graph theory is an active area with many open problems, especially regarding embeddings in $\mathbb{R}^d$ or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number…

We study systems of $n \geq 1$ discrete differential equations of order $k\geq1$ in one catalytic variable and provide a constructive and elementary proof of algebraicity of their solutions. This yields effective bounds and a systematic…

The main result in Y.~O.~Hamidoune's paper "Adding Distinct Congruence Classes" ({\em Combin.~Probab.~Comput.}~{\bf 7} (1998) 81-87) is as follows: If $S$ is a generating subset of a cyclic group $G$ such that $0 \not \in S$ and $|S| \geq…

For given integers a,b, and j at least 1 we determine the set of integers n for which a^n-b^n is divisible by n^j. For j=1,2, this set is usually infinite; we find explicitly the exceptional cases for which a,b the set is finite. For j=2,…