Related papers: Algorithmic local monomialization of a binomial: a…

Suppose that f is a dominant morphism from a k-variety X to a k-variety Y, where k is a field of characteristic 0 and v is a valuation of the function field k(X). We allow v to be an arbitary valuation, so it may not be discrete. We prove…

Let $f(x)$ be a separable polynomial over a local field. Montes algorithm computes certain approximations to the different irreducible factors of $f(x)$, with strong arithmetic properties. In this paper we develop an algorithm to improve…

While sporadic examples of virtual resolutions with homology have been constructed, their occurrence is not well understood or controlled. Our results build a new set of tools for studying virtual resolutions of monomial ideals as arising…

We discuss various aspects of representation of a polynomial as a sum of monomials (for example, uniqueness of such representation and related estimations).

In this paper we will show that monomial summability can be characterized using Borel-Laplace like integral transformations depending of a parameter $0<s<1$. We will apply this result to prove 1-summability in a monomial of formal solutions…

In this paper, we consider modular local polynomials. These functions satisfy modularity while they are locally defined as polynomials outside of an exceptional set. We prove an inequality for the dimension of the space of such forms when…

This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…

We study binomial D-modules, which generalize A-hypergeometric systems. We determine explicitly their singular loci and provide three characterizations of their holonomicity. The first of these states that a binomial D-module is holonomic…

The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

We give a combinatorial algorithm for equivariant embedded resolution of singularities of a toric variety defined over a perfect field. The algorithm is realized by a finite succession of blowings-up with smooth invariant centres that…

We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…

Localization is a topological technique that allows us to make global equivariant computations in terms of local data at the fixed points. For example, we may compute a global integral by summing integrals at each of the fixed points. Or,…

Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…

Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…

All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…

We consider a problem of clustering a sequence of multinomial observations by way of a model selection criterion. We propose a form of a penalty term for the model selection procedure. Our approach subsumes both the conventional AIC and BIC…

Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them…

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…