English
Related papers

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

200 papers

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

Number Theory · Mathematics 2023-05-23 Said Zriaa , Mohammed Mouçouf

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

General Mathematics · Mathematics 2024-07-25 Alaa Altassan , Murat Alan

It is shown that if n<7, then each tiling of R^n by translates of the unit cube [0,1)^n contains a column; that is, a family of the form {[0,1)^n+(s+ke_i): k \in Z}, where s \in R^n, e_i is an element of the standard basis of R^n and Z is…

Combinatorics · Mathematics 2008-09-12 Magdalena Łysakowska , Krzysztof Przesławski

We start from a parametrized system of $d$ generalized polynomial equations (with real exponents) for $d$ positive variables, involving $n$ generalized monomials with $n$ positive parameters. Existence and uniqueness of a solution for all…

Algebraic Geometry · Mathematics 2019-05-08 Stefan Müller , Josef Hofbauer , Georg Regensburger

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Complex Variables · Mathematics 2008-04-15 Milan Janjic

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…

Computational Complexity · Computer Science 2009-09-25 Marek Chrobak , Peter Couperus , Christoph Durr , Gerhard Woeginger

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more…

Geometric Topology · Mathematics 2010-08-03 Danielle O'Donnol

For a two-parameter family of lower triangular matrices with entries involving Jacobi polynomials an explicit inverse is given, with entries involving a sum of two Jacobi polynomials. The formula simplifies in the Gegenbauer case and then…

Classical Analysis and ODEs · Mathematics 2015-03-25 Leandro Cagliero , Tom H. Koornwinder

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

Number Theory · Mathematics 2021-11-30 P Vanchinathan , Krithika M

A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…

Combinatorics · Mathematics 2019-09-23 R. Brak , N. Mahony

We introduce an infinite family of lower triangular matrices $\Gamma^{(s)}$, where $\gamma_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ columns on a suitable subset of shapes. We show that the entries of…

Combinatorics · Mathematics 2008-03-17 M. Barnabei , F. Bonetti , M. Silimbani

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…

Combinatorics · Mathematics 2016-09-14 Richard J. Mathar

For every spatial embedding of each graph in the Petersen family, it is known that the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2. In this paper, we give an integral lift of this…

Geometric Topology · Mathematics 2020-05-19 Hiroka Hashimoto , Ryo Nikkuni

We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…

Combinatorics · Mathematics 2022-03-15 Juan B. Gil , Jessica A. Tomasko

Conway and Lagarias observed that a triangular region T(m) in a hexagonal lattice admits signed tiling by three-in-line polyominoes (tribones) if and only if m=9d-1 or m=9d for some integer d. We apply the theory of Groebner bases over…

Combinatorics · Mathematics 2014-09-10 Manuela Muzika Dizdarević , Marinko Timotijević , Rade T. Živaljević

A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…

Combinatorics · Mathematics 2021-02-23 Ivan Vasenov

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Combinatorics · Mathematics 2025-11-19 Mariah Moschetti , Christopher O'Neill

The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…

History and Overview · Mathematics 2018-11-07 Bernhard Moser

A positive integer $n$ is called a tiling number if the equilateral triangle can be dissected into $nk^2$ congruent triangles for some integer $k$. An integer $n>3$ is tiling number if and only if at least one of the elliptic curves…

Number Theory · Mathematics 2024-05-21 Keqin Feng , Qiuyue Liu , Jinzhao Pan , Ye Tian

Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…

Probability · Mathematics 2007-12-05 Marie Albenque , Jean-François Marckert