中文
相关论文

相关论文: Pascal arrays: counting Catalan sets

200 篇论文

We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these networks. Our framework…

机器学习 · 计算机科学 2024-07-15 Matthew Trager , Alessandro Achille , Pramuditha Perera , Luca Zancato , Stefano Soatto

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

计算机科学中的逻辑 · 计算机科学 2007-06-25 Christophe Fouqueré

Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.

综合数学 · 数学 2022-09-14 H. Nelson Crooks , Chigozie Nwoke

In this paper, we generalize the Catalan number to the $(n,k)$-th Catalan numbers and find a combinatorial description that the $(n,k)$-th Catalan numbers is equal to the number of partitions of $n(k-1)+2$ polygon by $(k+1)$-gon where all…

组合数学 · 数学 2015-01-28 Dongseok Kim

We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.

组合数学 · 数学 2007-05-23 Roland Bacher

In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.

数论 · 数学 2007-05-23 Zarko Mijajlovic , Milos Milosevic , Aleksandar Perovic

Catalan numbers $C(n)=\frac{1}{n+1}{2n\choose n}$ enumerate binary trees and Dyck paths. The distribution of paths with respect to their number $k$ of factors is given by ballot numbers $B(n,k)=\frac{n-k}{n+k}{n+k\choose n}$. These integers…

组合数学 · 数学 2008-11-03 Jean-Christophe Aval

In this paper we propose a unified approach to matrix representations of different types of Appell polynomials. This approach is based on the creation matrix - a special matrix which has only the natural numbers as entries and is closely…

经典分析与常微分方程 · 数学 2024-03-19 Lidia Aceto , Helmuth R. Malonek , Graça Tomaz

The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…

范畴论 · 数学 2007-05-23 John W. Barrett , Marco Mackaay

In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this…

组合数学 · 数学 2014-05-26 Christian Stump

We give a general account of family algebras over a finitely presented linear operad, this operad together with its presentation naturally defining an algebraic structure on the set of parameters.

环与代数 · 数学 2020-05-12 Loic Foissy , Dominique Manchon , Yuanyuan Zhang

Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…

组合数学 · 数学 2016-12-23 E. Burlachenko

This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…

组合数学 · 数学 2023-10-31 Boris Putievskiy

Let $f:\mathbb{Z}\longrightarrow \{ \times \cdot\}$ be a function such that $f(a) = \cdot$ for all except finitely for many $a \in \mathbb{Z}$. We define a set $\flat f$ of non-intersecting arc (or cap) diagrams satisfying certain…

组合数学 · 数学 2026-02-10 Ian M. Musson

A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…

组合数学 · 数学 2022-07-22 Yen-Jen Cheng , Sen-Peng Eu , Hsiang-Chun Hsu

In this work we introduce declarative statistics, a suite of declarative modelling tools for statistical analysis. Statistical constraints represent the key building block of declarative statistics. First, we introduce a range of relevant…

人工智能 · 计算机科学 2017-12-29 Roberto Rossi , Özgür Akgün , Steven Prestwich , S. Armagan Tarim

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

计算机科学中的逻辑 · 计算机科学 2022-06-06 Damian Arellanes

In this paper, we study Catalan numbers which can be represented by the p-adic integral on Zp and we investigate some properties and formulae related to Catalan numbers and special numbers.

数论 · 数学 2016-06-02 Taekyun Kim

We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…

环与代数 · 数学 2020-11-23 Peter A. Brooksbank , Joshua Maglione , James B. Wilson

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…

组合数学 · 数学 2017-10-18 Kyu-Hwan Lee , Se-jin Oh