Related papers: A polynomial generalization of the Euler character…
We compute the weighted Euler characteristic, equivariant with respect to the action of the symplectic group of degree six over the field of two elements, of the moduli space of principally polarized abelian threefolds together with a level…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
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…
Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…
As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…
We develop various aspects of classical enumerative geometry, including Euler characteristics and formulas for counting degenerate fibres in a pencil, with the classical numerical formulas being replaced by identitites in the…
We develop a general method for computing the homological Euler characteristic of finite index subgroups G of GL_m(O_K) where O_K is the ring of integers in a number field K. With this method we find, that for large, explicitly computed…
We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…
If a real value invariant of compact combinatorial manifolds (with or without boundary) depends only on the number of simplices in each dimension on the manifold, then the invariant is completely determined by Euler characteristics of the…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
In this paper we reconsider the problem of the Euler parametrization for the unitary groups. After constructing the generic group element in terms of generalized angles, we compute the invariant measure on SU(N) and then we determine the…
The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…
The notion of the orbifold Euler characteristic came from physics at the end of 80's. There were defined higher order versions of the orbifold Euler characteristic and generalized ("motivic") versions of them. In a previous paper the…
In this paper, we study some properties of umbral calculus related to Appell sequence. From those properties, we derive new and interesting identities of Frobenius-Euler polynomials.
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
The variational properties of the scalar so--called ``Universal'' equations are reviewed and generalised. In particular, we note that contrary to earlier claims, each member of the Euler hierarchy may have an explicit field dependence. The…