相关论文: Polya Theory for Orbiquotient Sets
P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We study several kinds of polynomial ensembles of derivative type which we propose to call P\'olya ensembles. These ensembles are defined on the spaces of complex square, complex rectangular, Hermitian, Hermitian anti-symmetric and…
In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's…
Joyal's theory of combiantorial species provides a rich and elegant framework for enumerating combinatorial structures by translating structural information into algebraic functional equations. We present some classical and folklore results…
We construct bulk-deformed orbifold Hamiltonian Floer theory for a global quotient orbifold, that is the quotient of a smooth closed symplectic manifold by a finite group acting faithfully via symplectomorphisms. The moduli spaces define an…
The P\'{o}lya group of an algebraic number field is a particular subgroup of the ideal class group. This article provides an overview of recent results on P\'{o}lya groups of number fields, their connection with the ring of integer-valued…
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
We present a new geometric proof of Stanley's monotonicity theorem for lattice polytopes, using an interpretation of $\delta$-polynomials of lattice polytopes in terms of orbifold Chow rings.
Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical…
In this note we attempt to develop an analog of P\'olya-Schur theory describing the class of univariate hyperbolicity preservers in the setting of linear finite difference operators. We study the class of linear finite difference operators…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
The Polya group of a number field K is the subgroup of the class group of K generated by the classes of the products of the maximal ideals with same norm. A Polya field is a number field whose Polya group is trivial. Our purpose is to start…
Motivated by orbifold string theory, we introduce orbifold cohomology group for any almost complex orbifold and orbifold Dolbeault cohomology for any complex orbifold. Then, we show that our new cohomology group satisfies Poincare duality…