Related papers: Etienne B\'ezout on Elimination Theory

In this article, we study systems of $n \geq 1$, not necessarily linear, discrete differential equations (DDEs) of order $k \geq 1$ with one catalytic variable. We provide a constructive and elementary proof of algebraicity of the solutions…

In this paper a novel calculus system has been established based on the concept of 'werden'. The basis of logic self-contraction of the theories on current calculus was shown. Mistakes and defects in the structure and meaning of the…

We first note that a result of Gowers on product-free sets in groups has an unexpected consequence: If k is the minimal degree of a representation of the finite group G, then for every subset B of G with $|B| > |G| / k^{1/3}$ we have B^3 =…

In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…

We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…

Let C be an algebraically closed field and X a projective curve over C. Consider an ordinary linear differential equation, or a linear differ- ence equation, with coefficients in the field of rational functions of X, and assume that its…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

In the historic conference Combinatoire Enumerative[LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre Leroux himself, who talked about his joint…

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles \textit{``Strong Reducibilities''} (1981) and \textit{``Reducibilities''} (1999). The problem asks whether every computably…

One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…

We show that the free Burnside groups $B(m,n)$ are infinite for $m\geq 2$ and odd $n\geq 557$, the best currently known lower bound for the exponent. The proof uses iterated small cancellation theory where the induction is based on the…

The divergence theorem of Gauss plays a central role in the derivation of the governing differential equations in fluid dynamics, electrodynamics, gravitational fields, and optics. One is often interested in an evolution equation for the…

This article explores the following methodological principle for theory construction in physics: if an ontological theory predicts two scenarios that are ontologically distinct but empirically indiscernible, then this theory should be…

The evoluted set is the set of configurations reached from an initial set via a fixed flow for all times in a fixed interval. We find conditions on the initial set and on the flow ensuring that the evoluted set has negligible boundary (i.e.…

Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…

A classical problem due to Abel is to determine if a differential equation $y'=\eta y$ admits a non-trivial solution $y$ algebraic over $\mathbb C(x)$ when $\eta$ is a given algebraic function over $\mathbb C(x)$. Risch designed an…

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

The aim of this paper is to start a systematic investigation of the arithmetic degree of projective schemes as introduced by D. Bayer and D. Mumford. One main theme concerns itself with the behaviour of this arithmetic degree under…

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The…