Related papers: A polynomial generalization of the Euler character…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
It is known to be difficult to find out whether a certain multivariable function to be a characteristic function when its corresponding measure is not tirivial to be or not to be a probability measure on R^d. Such results were not obtained…
We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…
Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…
We introduce characteristic numbers of a finite commutative unital $\mathbb{C}$-algebra, which are numerical invariants arising from algebraic intersection theory. We characterize Gorenstein and local complete intersection algebras in terms…
For certain tame abelian covers of arithmetic surfaces X/Y we obtain striking formulas, involving a quadratic form derived from intersection numbers, for the equivariant Euler characteristics of both the canonical sheaf !X/Y and also its…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
We obtain a precise relation between the Chern-Schwartz-MacPherson class of a subvariety of projective space and the Euler characteristics of its general linear sections. In the case of a hypersurface, this leads to simple proofs of…
In this paper, we establish more identities of generalized multi poly-Euler polynomials with three parameters and obtain a kind of symmetrized generalization of the polynomials. Moreover, generalized multi poly-Bernoulli polynomials are…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
Let $X \subset \Bbb{C}^n$ be an equidimensional complex algebraic set and let $f: X \to \mathbb{C}$ be a polynomial function. For each $c \in \Bbb{C}$, we define the global Brasselet number of $f$ at $c$, a global counterpart of the…
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…
We show how to calculate the Euler characteristic of a local system associated to an irreducible representation of the symplectic group of genus 3 on the moduli space of curves of genus 3 and the moduli space of principally polarized…
We provide a self-contained introduction to Gr\"obner bases of submodules of $R[x_1, \ldots, x_n]^k$, where $R$ is a Euclidean domain, and explain how to use these bases to solve linear systems over $R[x_1, \ldots, x_n]$.
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.