Related papers: Enumeration of generalized polyominoes

We formulate the following general problem. To the best of our knowledge, it is open and has not previously been considered. It seems (at least to us!) to be difficult; at any rate, more difficult than enumerating the dissections…

Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

The recent significant enrichment of the Order Completion Method for nonlinear Systems of PDEs resulted in the global existence of generalized solutions to a large class of such equations. In this paper we investigate the existence and…

Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

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…

In this paper, we establish an identity for Bernoulli's generalized polynomials. We deduce generalizations for many relations involving classical Bernoulli numbers or polynomials. In particular, we generalize a recent Gessel identity.

We introduce the notion of universal odd generalized Poisson superalgebra associated to an associative algebra A, by generalizing a construction made in [5]. By making use of this notion we give a complete classification of simple linearly…

In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…

Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…

In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…

We generalize the Brin-Higman-Thompson groups $n G_{k,1}$ to monoids $n M_{k,1}$, for $n \ge 1$ and $k \ge 2$, by replacing bijections by partial functions. The monoid $n M_{k,1}$ has $n G_{k,1}$ as its group of units, and is…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

A set $A$ of nonnegative integers is called a Sidon set if there is no Sidon 4-tuple, i.e., $(a,b,c,d)$ in $A$ with $a+b=c+d$ and $\{a, b\}\cap \{c, d\}=\emptyset$. Cameron and Erd\H os proposed the problem of determining the number of…

We provide the polynomial identities of algebras that are both generalized Poisson algebras and transposed Poisson algebras. We establish defining identities via single operation for generalized Poisson algebras and prove that Ito's theorem…

In this paper, we give explicit evaluation for some infinite series involving generalized (alternating) harmonic numbers. In addition, some formulas for generalized (alternating) harmonic numbers will also be derived.