Related papers: La m\'ethode des fa\c{c}ons
We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…
Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped…
The paper starts with a concise description of the recently developed semismooth* Newton method for the solution of general inclusions. This method is then applied to a class of variational inequalities of the second kind. As a result, one…
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily…
In this paper we consider the Newton polygons of $L$-functions coming from additive exponential sums associated to a polynomial over a finite field $\F_q$. These polygons define a stratification of the space of polynomials of fixed degree.…
We introduce a new compactification of the space of relative stable maps. This new method uses logarithmic geoemtry in the sense of Kato-Fontaine-Illusie rather than the expanded degeneration. The underlying structure of our log stable maps…
We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…
In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…
In this document we define a method of proof that we call proof by dichotomy. Its field of application is any proposition on the set of natural numbers N. It consists in the repetition of a step. A step proves the proposition for half of…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
We present a general approach to the problem of determining the asymptotic order of the variance of the optimal score between two independent random sequences defined over an arbitrary finite alphabet. Our general approach is based on…
A partitioned process theory, as defined by Coecke, Fritz, and Spekkens, is a symmetric monoidal category together with an all-object-including symmetric monoidal subcategory. We think of the morphisms of this category as processes, and the…
In this paper, we further consider the symmetry-based method for seeking nonlocally related systems for partial differential equations. In particular, we show that the symmetry-based method for partial differential equations is the natural…
An approach to stochastic evolution equations based on a simple generalization of known embedding theorems is presented. It allows for the inclusion of problems which have nonlinear non monotone operators. This is used to discuss the…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
We develop a general compactification framework to facilitate analysis of nonlinear nonautonomous ODEs where nonautonomous terms decay asymptotically. The strategy is to compactify the problem: the phase space is augmented with a bounded…
Let $X$ be a normal projective variety and $f:X\to X$ a non-isomorphic polarized endomorphism. We give two characterizations for $X$ to be a toric variety. First we show that if $X$ is $\mathbb{Q}$-factorial and $G$-almost homogeneous for…
Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…
The renormalization method based on the Taylor expansion for asymptotic analysis of differential equations is generalized to difference equations. The proposed renormalization method is based on the Newton-Maclaurin expansion. Several basic…
Autonomous morphology, such as inflection class systems and paradigmatic distribution patterns, is widespread and diachronically resilient in natural language. Why this should be so has remained unclear given that autonomous morphology…