English
Related papers

Related papers: A note on number triangles that are almost their o…

200 papers

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…

Other Computer Science · Computer Science 2008-02-21 Alexis Ballier , Bruno Durand , Emmanuel Jeandel

We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…

Number Theory · Mathematics 2025-09-15 Taekyun Kim , Dae san Kim , Jongkyum Kwon , Kyo-Shin Hwang

In this paper, we have constructed the higher order k-bonacci matrices and studied some of their basic properties. We have also shown that these matrices satisfying some new and interesting relations in k-bonacci recurrence. This is the…

Number Theory · Mathematics 2017-11-27 Shubhra Gupta

A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…

Combinatorics · Mathematics 2023-12-29 Sergi Elizalde , Alejandro B. Galván

In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…

Number Theory · Mathematics 2019-06-24 Kathrin Bringmann , Chris Jennings-Shaffer

Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…

Combinatorics · Mathematics 2015-04-08 Steve Butler , Fan Chung , Jay Cummings , Ron Graham

We show various supercongruences for truncated series which involve central binomial coefficients and harmonic numbers. The corresponding infinite series are also evaluated.

Number Theory · Mathematics 2017-01-31 Roberto Tauraso

The aim of this paper is to study generating functions for the coefficients of the classical superoscillatory function associated with weak measurements. We also establish some new relations between the superoscillatory coefficients and…

Classical Analysis and ODEs · Mathematics 2023-04-03 Fabrizio Colombo , Rolf Soeren Krausshar , Irene Sabadini , Yilmaz Simsek

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Combinatorics · Mathematics 2013-10-07 Matthias Beck

Sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. Among the known sequences, cyclotomic families have the optimal autocorrelation property. In this paper, we…

Information Theory · Computer Science 2009-09-28 Kai Cai , Rongquan Feng , Zhiming Zheng

In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…

Number Theory · Mathematics 2010-02-03 Ayhan Dil , Veli Kurt

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

Numerical Analysis · Mathematics 2014-11-14 Costanza Conti , Luca Gemignani , Lucia Romani

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Combinatorics · Mathematics 2022-03-23 Konrad Aguilar , Ángel Chávez , Stephan Ramon Garcia , Jurij Volčič

We introduce a family of modules, called Markoff modules, generated by a cluster-mutation-like iterative process. We show that these modules are combinatorially similar to Christoffel words. Furthermore, we construct a bijective map between…

Representation Theory · Mathematics 2011-11-15 Alex Lasnier

The main purpose of this paper is to introduce a new category, which we call a resonance category, whose combinatorics reflect that of canonical stratifications of $n$-fold symmetric smash products. The study of the stratifications can then…

Category Theory · Mathematics 2007-05-23 Dmitry N. Kozlov

In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.

Number Theory · Mathematics 2016-07-22 Taekyun Kim , Dmitry V. Dolgy , Dae san Kim , Jong-Jin Seo

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing…

Logic · Mathematics 2020-08-27 Samuel Allen Alexander

We produce an explicit family of totally real cyclic quartic polynomials that are monogenic in many cases and, if the $abc$ conjecture holds, generate distinct monogenic quartic fields infinitely often. Additional families (also…

Number Theory · Mathematics 2025-07-10 Paul M. Voutier

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…

Combinatorics · Mathematics 2007-05-23 Trueman MacHenry , Geanina Tudose

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Discrete Mathematics · Computer Science 2008-11-24 Shamik Ghosh