Related papers: A Generalization of Euler's Criterion to Composite…

We study properties of relative modular categories and derive sufficient conditions for their existence. In particular, we derive sufficient conditions for relative pre-modular categories to be non-degenerate and relative modular, and for…

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Combining the MPS degeneration formula for the Poincar\'e polynomial of moduli spaces of stable quiver representations and localization theory, it turns that the determination of the Euler characteristic of these moduli spaces reduces to a…

Here Euler notes the recursive relation for the general binomial coefficients, by assuming that (1+x)^a can be expanded in a power series.

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for…

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

It is well known that for irreducible, square-integrable representations of a locally compact group, there exist so-called admissible vectors which allow the construction of generalized continuous wavelet transforms. In this paper we…

Let $G$ be a topological commutative semigroup with unit. We prove that a continuous function $f\colon G\to \cc$ is a generalized exponential polynomial if and only if there is an $n\ge 2$ such that $f(x_1 +\ldots +x_n )$ is decomposable;…

Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Colored multiset Eulerian polynomials are a common generalization of MacMahon's multiset Eulerian polynomials and the colored Eulerian polynomials, both of which are known to satisfy well-studied distributional properties including…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

In 2002, it was conjectured that a free divisor satisfying the so-called Logarithmic Comparison Theorem must be strongly Euler-homogeneous and it was proved for the two-dimensional case. Later, in 2006, it was shown that the conjecture is…

In this note, we establish conditions under which the union of an increasing sequence of completely decomposable modules over domains are again completely decomposable. In our investigation, the condition of purity of modules is crucial. In…

We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…