Related papers: Euler characteristic reciprocity for chromatic, fl…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
Let $P$ be a poset, $inc(P)$ its incomparability graph, and $X_{inc(P)}$ the corresponding chromatic symmetric function, as defined by Stanley in {\em Adv. Math.}, {\bf 111} (1995) pp.~166--194. Certain conditions on $P$ imply that the…
The Euler-Poincar\'e characteristic of a finite-dimensional Lie algebra vanishes. If we want to extend this result to Lie superalgebras, we should deal with infinite sums. We observe that a suitable method of summation, which goes back to…
The notion of the truncated Euler characteristic for Iwasawa modules is a generalization of the the usual Euler characteristic to the case when the cohomology groups are not finite. Let $p$ be an odd prime, $E_1$ and $E_2$ be elliptic…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent…
Given an oriented graph G, the modular flow polynomial counts the number of nowhere-zero Z_k-flows of G. We give a description of the modular flow polynomial in terms of (open) Ehrhart polynomials of lattice polytopes. Using…
According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…
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…
We introduce new cardinal invariants of a poset, called the comparability number and the incomparability number. We determine their value for well-known posets, such as $\omega^\omega$, $\mathcal{P}(\omega)/\mathrm{fin}$, the Turing degrees…
We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
We derive an identity for certain linear combinations of polylogarithm functions with negative exponents, which implies relations for linear combinations of Eulerian numbers. The coefficients of our linear combinations are related to…
The main purpose of this paper is to study generalized (self-) reciprocal Appell polynomials, which play a certain role in connection with Faulhaber-type polynomials. More precisely, we show for any Appell sequence when satisfying a…
Let $\mathcal{E}$ be the $\sigma$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\…
Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…
In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…
Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…
A semigroup A is an abelian semigroup with identity 0. A set of positives in A is an ordered down-directed set P containing with every r an element r/2 with r/2 + r/2 = r. A continuity space is an abstract set X equipped with a map d : XxX…