Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Algebra (11)
- Computer Sciences (8)
- Other Mathematics (7)
- Number Theory (5)
- Theory and Algorithms (5)
-
- Geometry and Topology (4)
- Applied Mathematics (3)
- Logic and Foundations (3)
- Education (2)
- Life Sciences (2)
- Medicine and Health Sciences (2)
- Aerodynamics and Fluid Mechanics (1)
- Aerospace Engineering (1)
- Algebraic Geometry (1)
- Analysis (1)
- Analytical, Diagnostic and Therapeutic Techniques and Equipment (1)
- Anesthesia and Analgesia (1)
- Artificial Intelligence and Robotics (1)
- Cognitive Neuroscience (1)
- Computational Neuroscience (1)
- Control Theory (1)
- Data Science (1)
- Dynamical Systems (1)
- Engineering (1)
- Fluid Dynamics (1)
- Graphics and Human Computer Interfaces (1)
- Harmonic Analysis and Representation (1)
- Institution
-
- Georgia Southern University (21)
- Kutztown University (4)
- Prairie View A&M University (4)
- City University of New York (CUNY) (3)
- Rose-Hulman Institute of Technology (3)
-
- University of Kentucky (3)
- University of Massachusetts Amherst (3)
- William & Mary (3)
- Claremont Colleges (2)
- Illinois State University (2)
- Louisiana State University (2)
- The College of Wooster (2)
- University of Arkansas, Fayetteville (2)
- West Virginia University (2)
- Arcadia University (1)
- Butler University (1)
- California Polytechnic State University, San Luis Obispo (1)
- California State University, San Bernardino (1)
- Clemson University (1)
- Loyola University Chicago (1)
- Missouri State University (1)
- Murray State University (1)
- Portland State University (1)
- Rollins College (1)
- Smith College (1)
- St. John Fisher University (1)
- University of Central Florida (1)
- University of Louisville (1)
- University of Montana (1)
- University of Nebraska - Lincoln (1)
- Keyword
-
- Graph theory (7)
- Combinatorics (4)
- Mathematics (4)
- Abstract algebra (2)
- Cycles (2)
-
- Geometry (2)
- Graphs (2)
- Matroids (2)
- Number theory (2)
- Triangulation (2)
- $L(3 (1)
- $\alpha$-labeling (1)
- (s (1)
- 1)$-labeling (1)
- 2 (1)
- 2-Connected Graphs (1)
- 2-Domination number (1)
- Algebra (1)
- Algorithm (1)
- Alternate m-triangular snake graph (1)
- Amalgamation (1)
- Art (1)
- Art gallery problem (1)
- Art gallery theorem (1)
- Art vectorization (1)
- Associahedron (1)
- Automorphisms (1)
- B-nomial numbers (1)
- Betweenness-uniform graph (1)
- Bezier Curves (1)
- Publication
-
- Theory and Applications of Graphs (21)
- Applications and Applied Mathematics: An International Journal (AAM) (4)
- Communications on Number Theory and Combinatorial Theory (4)
- Doctoral Dissertations (4)
- Undergraduate Honors Theses (3)
-
- Annual Symposium on Biomathematics and Ecology Education and Research (2)
- Graduate Theses, Dissertations, and Problem Reports (2)
- HMC Senior Theses (2)
- LSU Doctoral Dissertations (2)
- Publications and Research (2)
- Rose-Hulman Undergraduate Mathematics Journal (2)
- Senior Independent Study Theses (2)
- Theses and Dissertations--Mathematics (2)
- All Dissertations (1)
- Capstone Showcase (1)
- Computer Science: Faculty Publications and Other Works (1)
- Department of Mathematics: Dissertations, Theses, and Student Research (1)
- Dissertations, Theses, and Capstone Projects (1)
- Electronic Theses and Dissertations (1)
- Electronic Theses, Projects, and Dissertations (1)
- Electronic Thesis and Dissertation Repository (1)
- Graduate Student Theses, Dissertations, & Professional Papers (1)
- Graduate Theses and Dissertations (1)
- Honors College Theses (1)
- Honors Program Theses (1)
- Honors Undergraduate Theses (1)
- MSU Graduate Theses (1)
- Master's Theses (1)
- Mathematical Sciences Technical Reports (MSTR) (1)
- Mathematical Sciences Undergraduate Honors Theses (1)
- Publication Type
Articles 31 - 60 of 76
Full-Text Articles in Discrete Mathematics and Combinatorics
Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov
Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov
Theory and Applications of Graphs
Let (X, d) be a semimetric space and let G be a graph. We say that G is the diametrical graph of (X, d) if X is the vertex set of G and the adjacency of vertices x and y is equivalent to the equality diam X = d(x, y). It is shown that a semimetric space (X, d) with diameter d* is ultrametric if the diametrical graph of (X, d ε) with d ε (x, y) = min{d(x, y), ε} is complete multipartite for every ε ∈ (0, d* …
Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs
Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs
UNO Student Research and Creative Activity Fair
The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.
Now there are three difficulty tiers to POW problems, roughly corresponding to …
An Even 2-Factor In The Line Graph Of A Cubic Graph, Seungjae Eom, Kenta Ozeki
An Even 2-Factor In The Line Graph Of A Cubic Graph, Seungjae Eom, Kenta Ozeki
Theory and Applications of Graphs
An even 2-factor is one such that each cycle is of even length. A 4- regular graph G is 4-edge-colorable if and only if G has two edge-disjoint even 2- factors whose union contains all edges in G. It is known that the line graph of a cubic graph without 3-edge-coloring is not 4-edge-colorable. Hence, we are interested in whether those graphs have an even 2-factor. Bonisoli and Bonvicini proved that the line graph of a connected cubic graph G with an even number of edges has an even 2-factor, if G has a perfect matching [Even cycles and …
On Two-Player Pebbling, Garth Isaak, Matthew Prudente, Andrea Potylycki, William Fagley, Joseph Marcinik
On Two-Player Pebbling, Garth Isaak, Matthew Prudente, Andrea Potylycki, William Fagley, Joseph Marcinik
Communications on Number Theory and Combinatorial Theory
Graph pebbling can be extended to a two-player game on a graph G, called Two-Player Graph Pebbling, with players Mover and Defender. The players each use pebbling moves, the act of removing two pebbles from one vertex and placing one of the pebbles on an adjacent vertex, to win. Mover wins if they can place a pebble on a specified vertex. Defender wins if the specified vertex is pebble-free and there are no more pebbling moves on the vertices of G. The Two-Player Pebbling Number of a graph G, η(G), is the minimum m such that for every arrangement …
Extensions And Bijections Of Skew-Shaped Tableaux And Factorizations Of Singer Cycles, Ga Yee Park
Extensions And Bijections Of Skew-Shaped Tableaux And Factorizations Of Singer Cycles, Ga Yee Park
Doctoral Dissertations
This dissertation is in the field of Algebraic and Enumerative Combinatorics. In the first part of the thesis, we study the generalization of Naruse hook-length formula to mobile posets. Families of posets like Young diagrams of straight shapes and d-complete posets have hook-length product formulas to count linear extensions, whereas families like Young diagrams of skew shapes have determinant or positive sum formulas like the Naruse hook-length formula (NHLF). In 2020, Garver et. al. gave determinant formulas to count linear extensions of a family of posets called mobile posets that refine d-complete posets and border strip skew shapes. We give …
Tiling Rectangles And 2-Deficient Rectangles With L-Pentominoes, Monica Kane
Tiling Rectangles And 2-Deficient Rectangles With L-Pentominoes, Monica Kane
Rose-Hulman Undergraduate Mathematics Journal
We investigate tiling rectangles and 2-deficient rectangles with L-pentominoes. First, we determine exactly when a rectangle can be tiled with L-pentominoes. We then determine locations for pairs of unit squares that can always be removed from an m × n rectangle to produce a tileable 2-deficient rectangle when m ≡ 1 (mod 5), n ≡ 2 (mod 5) and when m ≡ 3 (mod 5), n ≡ 4 (mod 5).
Structure Of Number Theoretic Graphs, Lee Trent
Structure Of Number Theoretic Graphs, Lee Trent
Mathematical Sciences Technical Reports (MSTR)
The tools of graph theory can be used to investigate the structure
imposed on the integers by various relations. Here we investigate two
kinds of graphs. The first, a square product graph, takes for its vertices
the integers 1 through n, and draws edges between numbers whose product
is a square. The second, a square product graph, has the same vertex set,
and draws edges between numbers whose sum is a square.
We investigate the structure of these graphs. For square product
graphs, we provide a rather complete characterization of their structure as
a union of disjoint complete graphs. For …
Studying Extended Sets From Young Tableaux, Eric S. Nofziger
Studying Extended Sets From Young Tableaux, Eric S. Nofziger
Undergraduate Honors Thesis Collection
Young tableaux are combinatorial objects related to the partitions of an integer that have various applications in representation theory. These tableaux are defined as a left-justified set of n boxes filled with the numbers 1 through n and organized in rows, with the length of each row corresponding to a summand in the partition. In recent work of Graham–Precup–Russell, an association has been made between a given row-strict tableau and three disjoint subsets I, J, and K, also called extended sets. In this project, we begin to classify which extended sets correlate to a valid row-strict or standard tableau. We …
Quantum Dimension Polynomials: A Networked-Numbers Game Approach, Nicholas Gaubatz
Quantum Dimension Polynomials: A Networked-Numbers Game Approach, Nicholas Gaubatz
Honors College Theses
The Networked-Numbers Game--a mathematical "game'' played on a simple graph--is incredibly accessible and yet surprisingly rich in content. The Game is known to contain deep connections to the finite-dimensional simple Lie algebras over the complex numbers. On the other hand, Quantum Dimension Polynomials (QDPs)--enumerative expressions traditionally understood through root systems--corresponding to the above Lie algebras are complicated to derive and often inaccessible to undergraduates. In this thesis, the Networked-Numbers Game is defined and some known properties are presented. Next, the significance of the QDPs as a method to count combinatorially interesting structures is relayed. Ultimately, a novel closed-form expression of …
Diederich-Fornæss Index On Boundaries Containing Crescents, Jason Demoulpied
Diederich-Fornæss Index On Boundaries Containing Crescents, Jason Demoulpied
Graduate Theses and Dissertations
The worm domain developed by Diederich and Fornæss is a classic example of a boundedpseudoconvex domains that fails to satisfy global regularity of the Bergman Projection, due to the set of weakly pseudoconvex points that form an annulus in its boundary. We instead examine a bounded pseudoconvex domain Ω ⊂ C2 whose set of weakly pseudoconvex points form a crescent in its boundary. In 2019, Harrington had shown that these types of domains satisfy global regularity of the Bergman Projection based on the existence of good vector fields. In this thesis we study the Regularized Diederich-Fornæss index of these domains, …
Modern Theory Of Copositive Matrices, Yuqiao Li
Modern Theory Of Copositive Matrices, Yuqiao Li
Undergraduate Honors Theses
Copositivity is a generalization of positive semidefiniteness. It has applications in theoretical economics, operations research, and statistics. An $n$-by-$n$ real, symmetric matrix $A$ is copositive (CoP) if $x^T Ax \ge 0$ for any nonnegative vector $x \ge 0.$ The set of all CoP matrices forms a convex cone. A CoP matrix is ordinary if it can be written as the sum of a positive semidefinite (PSD) matrix and a symmetric nonnegative (sN) matrix. When $n < 5,$ all CoP matrices are ordinary. However, recognizing whether a given CoP matrix is ordinary and determining an ordinary decomposition (PSD + sN) is still an unsolved problem. Here, we give an overview on modern theory of CoP matrices, talk about our progress on the ordinary recognition and decomposition problem, and emphasis the graph theory aspect of ordinary CoP matrices.
Extremal Problems In Graph Saturation And Covering, Adam Volk
Extremal Problems In Graph Saturation And Covering, Adam Volk
Department of Mathematics: Dissertations, Theses, and Student Research
This dissertation considers several problems in extremal graph theory with the aim of finding the maximum or minimum number of certain subgraph counts given local conditions. The local conditions of interest to us are saturation and covering. Given graphs F and H, a graph G is said to be F-saturated if it does not contain any copy of F, but the addition of any missing edge in G creates at least one copy of F. We say that G is H-covered if every vertex of G is contained in at least one copy of H. In the former setting, we …
3-Uniform 4-Path Decompositions Of Complete 3-Uniform Hypergraphs, Rachel Mccann
3-Uniform 4-Path Decompositions Of Complete 3-Uniform Hypergraphs, Rachel Mccann
Mathematical Sciences Undergraduate Honors Theses
The complete 3-uniform hypergraph of order v is denoted as Kv and consists of vertex set V with size v and edge set E, containing all 3-element subsets of V. We consider a 3-uniform hypergraph P7, a path with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge set {{v1, v2, v3}, {v2, v3, v4}, {v4, v5, v6}, {v5, v6 …
Enumerating Switching Isomorphism Classes Of Signed Graphs, Nathaniel Healy
Enumerating Switching Isomorphism Classes Of Signed Graphs, Nathaniel Healy
Undergraduate Honors Theses
Let Γ be a simple connected graph, and let {+,−}^E(Γ) be the set of signatures of Γ. For σ a signature of Γ, we call the pair Σ = (Γ,σ) a signed graph of Γ. We may define switching functions ζ_X ∈ {+, −}^V (Γ) that negate the sign of every edge {u, v} incident with exactly one vertex in the fiber X = ζ^{−1}(−). The group Sw(Γ) of switching functions acts X on the set of signed graphs of Γ and induces an equivalence relation of switching classes in its orbits; there are 2^{|E(Γ)|−|V (Γ)|+1} such classes. More interestingly, …
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
The Review: A Journal of Undergraduate Student Research
The art gallery problem is a geometry question that seeks to find the minimum number of guards necessary to guard an art gallery based on the qualities of the museum’s shape, specifically the number of walls. Solved by Václav Chvátal in 1975, the resulting Art Gallery Theorem dictates that ⌊n/3⌋ guards are always sufficient and sometimes necessary to guard an art gallery with n walls. This theorem, along with the argument that proves it, are accessible and interesting results even to one with little to no mathematical knowledge, introducing readers to common concepts in both geometry and graph …
A New Method To Compute The Hadamard Product Of Two Rational Functions, Ishan Kar
A New Method To Compute The Hadamard Product Of Two Rational Functions, Ishan Kar
Rose-Hulman Undergraduate Mathematics Journal
The Hadamard product (denoted by∗) of two power series A(x) =a0+a1x+a2x2+···and B(x) =b0+b1x+b2x2+··· is the power series A(x)∗B(x) =a0b0+a1b1x+a2b2x2+···. Although it is well known that the Hadamard product of two rational functions is also rational, a closed form expression of the Hadamard product of rational functions has not been found. Since any rational power series can be expanded by partial fractions as a polynomial plus a sum of power series …
An Implementation Of Integrated Information Theory In Resting-State Fmri, Idan E. Nemirovsky
An Implementation Of Integrated Information Theory In Resting-State Fmri, Idan E. Nemirovsky
Electronic Thesis and Dissertation Repository
Integrated Information Theory (IIT) is a framework developed to explain consciousness, arguing that conscious systems consist of interacting elements that are integrated through their causal properties. In this study, we present the first application of IIT to functional magnetic resonance imaging (fMRI) data and investigate whether its principal metric, Phi, can meaningfully quantify resting-state cortical activity patterns. Data was acquired from 17 healthy subjects who underwent sedation with propofol, a short acting anesthetic. Using PyPhi, a software package developed for IIT, we thoroughly analyze how Phi varies across different networks and throughout sedation. Our findings indicate that variations in Phi …
Some Np-Complete Edge Packing And Partitioning Problems In Planar Graphs, Jed Yang
Some Np-Complete Edge Packing And Partitioning Problems In Planar Graphs, Jed Yang
Communications on Number Theory and Combinatorial Theory
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges. Bernáth and Király proved that this decision problem is NP-complete and asked if the same result holds when restricting to planar graphs. Similarly, they showed that the packing problem with a spanning tree and a path between two distinguished vertices is NP-complete. They also established the NP-completeness of the partitioning problem of determining whether the edge set of a graph can be …
Characterizations Of Certain Classes Of Graphs And Matroids, Jagdeep Singh
Characterizations Of Certain Classes Of Graphs And Matroids, Jagdeep Singh
LSU Doctoral Dissertations
``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplifies a more general theorem about matroids." Most of my work draws inspiration from this assertion, made by Tutte in 1979.
In 2004, Ehrenfeucht, Harju and Rozenberg proved that all graphs can be constructed from complete graphs via a sequence of the operations of complementation, switching edges and non-edges at a vertex, and local complementation. In Chapter 2, we consider the binary matroid analogue of each of these graph operations. We prove that the analogue of the result of Ehrenfeucht et. al. does …
Unavoidable Structures In Large And Infinite Graphs, Sarah Allred
Unavoidable Structures In Large And Infinite Graphs, Sarah Allred
LSU Doctoral Dissertations
In this work, we present results on the unavoidable structures in large connected and large 2-connected graphs. For the relation of induced subgraphs, Ramsey proved that for every positive integer r, every sufficiently large graph contains as an induced subgraph either Kr or Kr. It is well known that, for every positive integer r, every sufficiently large connected graph contains an induced subgraph isomorphic to one of Kr, K1,r, and Pr. We prove an analogous result for 2-connected graphs. Similarly, for infinite graphs, every infinite connected graph contains an induced subgraph …
The Enumeration Of Minimum Path Covers Of Trees, Merielyn Sher
The Enumeration Of Minimum Path Covers Of Trees, Merielyn Sher
Undergraduate Honors Theses
A path cover of a tree T is a collection of induced paths of T that are vertex disjoint and cover all the vertices of T. A minimum path cover (MPC) of T is a path cover with the minimum possible number of paths, and that minimum number is called the path cover number of T. A tree can have just one or several MPC's. Prior results have established equality between the path cover number of a tree T and the largest possible multiplicity of an eigenvalue that can occur in a symmetric matrix whose graph is that tree. We …
Prime Labelings On Planar Grid Graphs, Stephen James Curran
Prime Labelings On Planar Grid Graphs, Stephen James Curran
Theory and Applications of Graphs
It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn. We show that PpxPn has a prime labeling for any odd prime p and any integer n such that that p<n≤p2.
Characterizing Edge Betweenness-Uniform Graphs, Jana Coroničová Hurajová, Tomas Madaras, Darren A. Narayan
Characterizing Edge Betweenness-Uniform Graphs, Jana Coroničová Hurajová, Tomas Madaras, Darren A. Narayan
Theory and Applications of Graphs
The betweenness centrality of an edge e is, summed over all u,v ∈ V(G), the ratio of the number of shortest u,v-paths in G containing e to the number of shortest u,v-paths in G. Graphs whose vertices all have the same edge betweenness centrality are called edge betweeness-uniform. It was recently shown by Madaras, Hurajová, Newman, Miranda, Fl´orez , and Narayan that of the over 11.7 million graphs with ten vertices or fewer, only four graphs are edge betweenness-uniform but not edge-transitive. In this paper we present new results involving properties of betweenness-uniform graphs.
Chromatic Polynomials Of Signed Book Graphs, Deepak Sehrawat, Bikash Bhattacharjya
Chromatic Polynomials Of Signed Book Graphs, Deepak Sehrawat, Bikash Bhattacharjya
Theory and Applications of Graphs
For m ≥ 3 and n ≥ 1, the m-cycle book graph B(m,n) consists of n copies of the cycle Cm with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed B(m,n) is n+1, and (b) the chromatic number of a signed B(m,n) is either 2 or 3. We also obtain explicit formulas for the chromatic polynomials and the zero-free chromatic polynomials of switching non-isomorphic signed book graphs.
Moving Polygon Methods For Incompressible Fluid Dynamics, Chris Chartrand
Moving Polygon Methods For Incompressible Fluid Dynamics, Chris Chartrand
Doctoral Dissertations
Hybrid particle-mesh numerical approaches are proposed to solve incompressible fluid flows. The methods discussed in this work consist of a collection of particles each wrapped in their own polygon mesh cell, which then move through the domain as the flow evolves. Variables such as pressure, velocity, mass, and momentum are located either on the mesh or on the particles themselves, depending on the specific algorithm described, and each will be shown to have its own advantages and disadvantages. This work explores what is required to obtain local conservation of mass, momentum, and convergence for the velocity and pressure in a …
Minimality Of Integer Bar Visibility Graphs, Emily Dehoff
Minimality Of Integer Bar Visibility Graphs, Emily Dehoff
University Honors Theses
A visibility representation is an association between the set of vertices in a graph and a set of objects in the plane such that two objects have an unobstructed, positive-width line of sight between them if and only if their two associated vertices are adjacent. In this paper, we focus on integer bar visibility graphs (IBVGs), which use horizontal line segments with integer endpoints to represent the vertices of a given graph. We present results on the exact widths of IBVGs of paths, cycles, and stars, and lower bounds on trees and general graphs. In our main results, we find …
Connectedness Of Unit Distance Subgraphs Induced By Closed Convex Sets, Remie Janssen, Leonie Van Steijn
Connectedness Of Unit Distance Subgraphs Induced By Closed Convex Sets, Remie Janssen, Leonie Van Steijn
Theory and Applications of Graphs
The unit distance graph G1Rd is the infinite graph whose nodes are points in Rd, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version G1R2 of this graph is typically studied for its chromatic number, as in the Hadwiger-Nelson problem. However, other properties of unit distance graphs are rarely studied. Here, we consider the restriction of G1Rd to closed convex subsets X of Rd. We show that the graph G1Rd[X] is connected precisely when the radius of …
Application Of The Combinatorial Nullstellensatz To Integer-Magic Graph Labelings, Richard M. Low, Dan Roberts
Application Of The Combinatorial Nullstellensatz To Integer-Magic Graph Labelings, Richard M. Low, Dan Roberts
Theory and Applications of Graphs
Let A be a nontrivial abelian group and A* = A \ {0}. A graph is A-magic if there exists an edge labeling f using elements of A* which induces a constant vertex labeling of the graph. Such a labeling f is called an A-magic labeling and the constant value of the induced vertex labeling is called an A-magic value. In this paper, we use the Combinatorial Nullstellensatz to show the existence of Ζp-magic labelings (prime p ≥ 3 ) for various graphs, without having to construct the Ζp-magic labelings. Through many …
Facial Achromatic Number Of Triangulations With Given Guarding Number, Naoki Matsumoto, Yumiko Ohno
Facial Achromatic Number Of Triangulations With Given Guarding Number, Naoki Matsumoto, Yumiko Ohno
Theory and Applications of Graphs
A (not necessarily proper) k-coloring c : V(G) → {1,2,…k} of a graph G on a surface is a facial t-complete k-coloring if every t-tuple of colors appears on the boundary of some face of G. The maximum number k such that G has a facial t-complete k-coloring is called a facial t-achromatic number of G, denoted by ψt(G). In this paper, we investigate the relation between the facial 3-achromatic number and guarding number of triangulations on a surface, where a guarding number of a graph G embedded on a surface, …
Generating B-Nomial Numbers, Ji Young Choi
Generating B-Nomial Numbers, Ji Young Choi
Communications on Number Theory and Combinatorial Theory
This paper presents three new ways to generate each type of b-nomial numbers: We develop ordinary generating functions, we find a whole new set of recurrence relations, and we identify each b-nomial number as a single binomial coefficient or as an alternating sum of products of two binomial coefficients.