Results 51 to 60 of about 225 (160)
Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.Let Gn = Cn□P2 be the prism graph on 2n vertices. The dominion ζ(Gn) counts the minimum dominating sets of Gn. Encoding column selections as cyclic words over a quaternary alphabet converts domination into explicit local adjacency constraints, reducing the count of minimum dominating sets to the enumeration of minimum‐weight admissible words.
Julian Allagan +4 more
wiley +1 more source
Descent c-Wilf Equivalence [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote the number of
Quang T. Bach, Jeffrey B. Remmel
doaj +1 more source
n‐Color partitions with weighted differences equal to minus two
International Journal of Mathematics and Mathematical Sciences, Volume 20, Issue 4, Page 759-768, 1997., 1997 In this paper we study those n‐color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to −2 Results obtained in this paper for these partitions include several combinatorial identities, recurrence relations, generating functions, relationships with the divisor function and computer produced tables.
A. K. Agarwal, R. Balasubrananian
wiley +1 more source
Topological recursion for fully simple maps from ciliated maps [PDF]
We solve a conjecture from the first and third authors that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy topological recursion for the exchanged spectral curve \((y, x)\), making use of the ...
Garcia-Failde, Elba +5 more
core +1 more source
Exact enumeration of satisfiable 2-SAT formulae [PDF]
, 2023 We obtain exact expressions counting the satisfiable 2-SAT formulae and describe the structure of associated implication digraphs. Our approach is based on generating function manipulations.
Dovgal, Sergey +2 more
core +1 more source
Equivalence classes of mesh patterns with a dominating pattern [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Two mesh patterns are coincident if they are avoided by the same set of permutations, and are Wilf-equivalent if they have the same number of avoiders of each length.
Murray Tannock, Henning Ulfarsson
doaj +1 more source
Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.The Hermite–Hadamard inequality, which is widely recognized and studied in the field of inequalities, and the k‐Riemann–Liouville fractional integral inequality, which is a generalization of the Riemann–Liouville fractional operator in operator theory, play a significant role in the existing literature concerning the concept of inequality.
Çetin Yıldız +4 more
wiley +1 more source
A new class of infinite products, and Euler′s totient
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 3, Page 417-422, 1994., 1993 We introduce some new infinite products, the simplest being where ϕk is the set of positive integers less than and relatively prime to k, valid for |y|∧|qy| both less than unity, with q ≠ 1. The idea of a q‐analogue for the Euler totient function is suggested.
Geoffrey B. Campbell
wiley +1 more source
Some Identities of the Probabilistic Changhee Polynomials and Their Applications
Journal of Mathematics, Volume 2026, Issue 1, 2026.Special numbers and polynomials are very important tools in diverse fields such as mathematics, physics, engineering, science, and related disciplines, addressing problems in areas like mathematical physics, numerical analysis, differential equations, fluid dynamics, and quantum mechanics.
Jin-Woo Park +4 more
wiley +1 more source
An infinite version of the Pólya enumeration theorem
International Journal of Mathematics and Mathematical Sciences, Volume 15, Issue 4, Page 697-700, 1992., 1991 Using measure theory, the orbit counting form of Pólya′s enumeration theorem is extended to countably infinite discrete groups.
Robert A. Bekes
wiley +1 more source