scientific article; zbMATH DE number 7154175
From MaRDI portal
Publication:5210579
zbMath1454.05009MaRDI QIDQ5210579
Armend Sh. Shabani, Toufik Mansour
Publication date: 21 January 2020
Full work available at URL: http://www.dmlett.com/archive/DML19_v2_p.65_94.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)
Related Items (9)
Maxima and visibility in involutions ⋮ Parameters in inversion sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semi-perimeter and inner site-perimeter of k-ary words and bargraphs ⋮ Unnamed Item ⋮ Counting lattice points on bargraphs of Catalan words ⋮ Visibility in pattern-restricted permutations ⋮ Visibility in non-crossing and non-nesting partitions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The height and width of bargraphs
- Statistics on bargraphs viewed as cornerless Motzkin paths
- Average site perimeter of directed animals on the two-dimensional lattices
- The number of three-choice polygons
- Polygons, polyominoes and polycubes
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
- Counting polyominoes: yet another attack
- Bijective proofs of some classical partition identities
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- Algebraic languages and polyominoes enumeration
- Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption
- A new way of counting the column-convex polyominoes by perimeter
- The site-perimeter of bargraphs
- Identically distributed pairs of partition statistics
- A bijection between bargraphs and Dyck paths
- Durfee squares in compositions
- Nonintersecting lattice paths on the cylinder
- Interior vertices in set partitions
- Generating functions for column-convex polyominoes
- Computational science -- ICCS 2003. International conference, Melbourne, Australia and St. Petersburg, Russia, June 2--4, 2003. Proceedings, Part III.
- An object grammar for column-convex polyominoes
- Engel's inequality for Bell numbers
- A method for the enumeration of various classes of column-convex polygons
- Circular bargraphs
- The perimeter of words
- Skew Dyck paths, area, and superdiagonal bargraphs
- The perimeter and site-perimeter of set partitions
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Three-letter-pattern avoiding permutations and functional equations
- Counting corners in partitions
- Restricted integer partition functions
- Combinatorics of Permutations
- Commutation Relations, Normal Ordering, and Stirling Numbers
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Levels in bargraphs
- Effect of stiffness on the pulling of an adsorbing polymer from a wall: an exact solution of a partially directed walk model
- Exactly Solved Models
- Exact solution of the staircase and row-convex polygon perimeter and area generating function
- The arithmetic of partitions into distinct parts
- Statistics of lattice animals (polyominoes) and polygons
- Counting corners in compositions and set partitions presented as bargraphs
- Combinatorics of Set Partitions
- Statistics of collapsing lattice animals
- Enumerating 2D percolation series by the finite-lattice method: theory
- Shedding light on words
- Combinatorial parameters on bargraphs of permutations
- The Perimeter of 2-Compositions
- Counting water cells in bargraphs of compositions and set partitions
- Combinatorics of Compositions and Words
- Counting 1 × 2 rectangles in set partitions
- Combinatorial parameters in bargraphs
- Bargraph statistics on words and set partitions
- Two Theorems of Euler and a General Partition Theorem
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Bargraphs in bargraphs
- Perimeter generating function for row-convex polygons on the rectangular lattice
- Enumerations of lattice animals and trees
This page was built for publication:
