Related papers: A polynomial generalization of the Euler character…
In this article, we study Euler characteristic techniques in topological data analysis. Pointwise computing the Euler characteristic of a family of simplicial complexes built from data gives rise to the so-called Euler characteristic…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
The number of ad-nilpotent ideals of the Borel subalgebra of the classical Lie algebra of type B_n is determined using combinatorial arguments involving a generalization of Dyck-paths. We also solve a similar problem for the untwisted…
In this work, we derive numerous identities for multivariate q-Euler polynomials by using umbral calculus.
With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…
It is well known that the Euler characteristic of the cohomology of a complex algebraic variety coincides with the Euler characteristic of its cohomology with compact support. An old result of G. Laumon asserts that a relative version of…
An explicit formula for the canonical bilinear form on the Grothendieck ring of the Lie supergroup $GL(n,m)$ is given. As an application we get an algorithm for the decomposition Euler characters in terms of characters of irreducible…
We compute Euler characteristics of p-subgroup categories of finite groups
We determine all the equivariant Euler characteristics of the building for the general unitary group over a finite field.
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
We establish an expression of the \EC~of a $r$-regular planar set in function of some variographic quantities. The usual $\mathcal{C} ^{2}$ framework is relaxed to a $\mathcal{C} ^{1,1}$ regularity assumption, generalising existing local…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
In this paper, we will compute the characteristic polynomials for finite dimensional representations of classical complex Lie algebras and the exceptional Lie algebra of type G2, which can be obtained through the orbits of integral weights…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
Using the weak factorization theorem we give a simple presentation for the value group of the universal Euler characteristic with compact support for varieties of characteristic zero and describe the value group of the universal Euler…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…