English
Related papers

Related papers: On a Two-Parameter Family of Generalizations of Pa…

200 papers

We explore a certain family $\{A_n\}_{n=1}^{\infty}$ of $n \times n$ tridiagonal real symmetric matrices. After deriving a three-term recurrence relation for the characteristic polynomials of this family, we find a closed form solution. The…

Combinatorics · Mathematics 2023-08-23 Emily Gullerud , Rita Johnson , aBa Mbirika

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Algebraic Geometry · Mathematics 2008-07-22 Tim Netzer

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Rings and Algebras · Mathematics 2023-04-27 Luis Verde-Star

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

Number Theory · Mathematics 2011-03-25 Victor J. W. Guo , Jiang Zeng

In this paper we investigate a family of matroids introduced by Ardila and Billey to study one-dimensional intersections of complete flag arrangements of $\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle $S_n$…

Combinatorics · Mathematics 2018-11-20 Felix Gotti , Harold Polo

For each $p>0$ we define by recurrence a triangle $T^p(n,k)$ whose rows sum to the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$, generalizing the known Catalan triangle corresponding to the case $p=2$. (In fact, $T^p(n,k)$ has an…

Combinatorics · Mathematics 2024-02-26 Francesca Aicardi

The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…

History and Overview · Mathematics 2021-08-23 Le Viet Hung , Tan Yiming , Huang Keyi , Jin Qingyang

All edge-to-edge tilings of the sphere by congruent regular triangles and congruent rhombi are classified as: (1) a $1$-parameter family of protosets each admitting a unique $(2a^3,3a^4)$-tiling like a triangular prism; (2) a $1$-parameter…

Combinatorics · Mathematics 2023-11-27 Qi Yuan , Erxiao Wang

We study tilings of rectangular boards using unit squares together with a single type of big tile shaped as a Ferrers diagram. We derive generating functions for these tilings, prove real-rootedness and interlacing properties of associated…

Combinatorics · Mathematics 2026-05-06 John Ahlberg , Per Alexandersson

We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schr\"oder…

Combinatorics · Mathematics 2012-09-25 Frédéric Bosio , Marc A. A. Van Leeuwen

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

Combinatorics · Mathematics 2019-05-07 Robert W. Donley,

The generalized Fibonacci recurrence $g_n=g_{n-k}+g_{n-m}$ was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a…

Combinatorics · Mathematics 2020-01-01 Natasha Blitvić , Vicente I. Fernandez

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

Number Theory · Mathematics 2020-08-25 Eric F. Bravo , Jhon J. Bravo , Carlos A. Gómez

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

Let $d>m>1$ be integers, let $c_1,\dots, c_{m+1}$ be distinct complex numbers, and let $\mathbf{f}(z):=z^d+t_1z^{m-1}+t_2z^{m-2}+\cdots + t_{m-1}z+t_m$ be an $m$-parameter family of polynomials. We prove that the set of $m$-tuples of…

Dynamical Systems · Mathematics 2016-11-01 Dragos Ghioca , Liang-Chung Hsia , Khoa Dang Nguyen

F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N(a)…

Combinatorics · Mathematics 2009-01-13 M. Dziemianczuk

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

The main purpose of this paper is to present a kneading theory for two-dimensional triangular maps. This is done by defining a tensor product between the polynomials and matrices corresponding to the one-dimensional basis map and fiber map.…

Dynamical Systems · Mathematics 2007-05-23 Diana A. Mendes , J. Sousa Ramos

In this paper we consider tiling $\{p, q \}$ of the Euclidean space and of the hyperbolic space, and its dual graph $\Gamma_{q, p}$ from a combinatorial point of view. A substitution $\sigma_{q, p}$ on an appropriate finite alphabet is…

Computational Geometry · Computer Science 2007-05-23 Maurice Margenstern , Guentcho Skordev

In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with…

Combinatorics · Mathematics 2018-07-26 Dennis Eichhorn , Hayan Nam , Jaebum Sohn