Related papers: A correct proof of the heuristic GCD algorithm
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…
We discuss the correlated systematic theoretical uncertainties that may be ascribed to the next-to-leading order QCD theory used to predict the one-jet inclusive cross section in hadron collisions. We estimate the magnitude of these errors…
We consider geometric invariant theory for \emph{graded additive groups}, groups of the form $\mathbb{G}_a^r\rtimes_w\mathbb{G}_m$ such that the $\mathbb{G}_m$-action on $\mathbb{G}_a^r$ is a scalar multiplication with weight…
We present a proof of Hadamard Inverse Function Theorem by the methods of Variational Analysis, adapting an idea of I. Ekeland and E. Sere.
A very explicit analytic formula of the separability criterion of two-party Gaussian systems is given. This formula is compared to the past formulation of the separability criterion of continuous variables two-party Gaussian systems.
In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.
We consider the problem of breaking a multivariate (vector) time series into segments over which the data is well explained as independent samples from a Gaussian distribution. We formulate this as a covariance-regularized maximum…
This paper is about solving polynomial systems. It first recalls how to do that efficiently with a very high probability of correctness by reconstructing a rational univariate representation (rur) using Groebner revlex computation,…
We propose a criterion of equidistribution by the differentiability of certain arithmetic invariants. Combined with the slope method and the asymptotic measures, this criterion gives a new "conceptual" proof to equidistribution results…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…
We provide a new algorithm (called the grid algorithm) designed to generate the image of the attractor of a generalized iterated function system on a finite dimensional space and we compare it with the deterministic algorithm regarding…
Our goal in the present paper is to give a new ergodic proof of a well-known Veech's result, build upon our previous works.
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
Grammatical error correction (GEC) is the task of detecting and correcting errors in a written text. The idea of combining multiple system outputs has been successfully used in GEC. To achieve successful system combination, multiple…
We construct a quotient ring of the ring of diagonal coinvariants of the complex reflection group $W=G(m,p,n)$ and determine its graded character. This generalises a result of Gordon for Coxeter groups. The proof uses a study of category…
We aim to prove a twisted version of the Osborne conjecture obtained by Hecht and Schmid in their 1983 Acta Mathematica paper. Bergeron and Clozel (2013) have considered a special case, and we generalize their method to our setting.
The Ward error sum of squares hierarchical clustering method has been very widely used since its first description by Ward in a 1963 publication. It has also been generalized in various ways. However there are different interpretations in…