Related papers: A polynomial generalization of the Euler character…

In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…

The Euler characteristic of the link of a real algebraic variety is an interesting topological invariant in order to discuss local topological properties. We prove in the paper that an invariant stronger than the Euler Characteristic is…

In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number--theoretical properties. A new class of…

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

The classical characteristic map associates symmetric functions to characters of the symmetric groups. There are two natural analogues of this map involving the Brauer algebra. The first of them relies on the action of the orthogonal or…

In this paper, we will define general Eulerian numbers and Eulerian polynomials based on general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian…

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

In this paper, Euler gives the general trionomial coefficient as a sum of the binomial coefficients, the general quadrinomial coefficient as a sum of the binomial and trinomial coefficients, the general quintonomial coefficient as a sum of…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

In this paper, we study degenerate ordered Bell polynomials with the viewpoint of Carlitz's degenerate Bernoulli and Euler polynomials and derive by using umbral calculus some properties and new identities for the degenerate ordered Bell…

We discuss the universal orbifold Euler characteristic and generalized orbifold Euler characteristics corresponding to finitely generated groups $A$ (the $A$-Euler characteristics). We show that the collection of all $A$-Euler…

We introduce the universal Euler characteristic of orbit space definable groupoids, a class of groupoids containing cocompact proper Lie groupoids as well as translation groupoids associated to proper definable group actions. We show that…

We determine the expected curvature polynomial of random real projective varieties given as the zero set of independent random polynomials with Gaussian distribution, whose distribution is invariant under the action of the orthogonal group.…

We study the relationship between $n$-cluster tilting modules over $n$ representation finite algebras and the Euler forms. We show that the dimension vectors of cluster-indecomposable modules give the roots of the Euler form. Moreover, we…

For a discrete group $\Gamma$ satisfying some finiteness conditions we give a Bredon projective resolution of the trivial module in terms of projective covers of the chain complex associated to certain posets of subgroups. We use this to…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

By the work of J.Huh, one can interpret binomial coefficients as a solution to an intersection problem on a permutohedral variety $X_E$. Applying Hirzebruch-Riemann-Roch, this intersection problem is equivalent to computing Euler…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…