Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 174295

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

4 votes
1 answer
296 views

How are the Eulerian numbers of the first-order related to the Eulerian numbers of the secon...

The question is inspired by G. Rzadkowski and M. Urlinska's examples in their paper A Generalization of the Eulerian Numbers. They refer to the discussion Expressions involving Eulerian numbers of the …
Peter Luschny's user avatar
0 votes
Accepted

How are the Eulerian numbers of the first-order related to the Eulerian numbers of the secon...

The identity is valid. This is a corollary to a proof of Amy M. Fu, Some Identities Related to the Second-Order Eulerian Numbers. A second proof follows from recent work of Cormac O'Sullivan, Stirling …
Peter Luschny's user avatar
2 votes

The factorials of -1, -2, -3, …

Hadrian Ulgenes David Peter give the following answer in Series and Product Representations of Gamma and Pseudogamma Functions, Theorem 5: The function \begin{equation} \Lambda(x)=\prod_{n=1}^{\infty} …
Peter Luschny's user avatar
4 votes
0 answers
124 views

A combinatorial triangle for the Bernoulli numbers

Motivation: We informally call an infinite lower triangular matrix $\operatorname{T}(n, k)$ of integers a combinatorial triangle of a sequence of integers or rational numbers if it can be obtained fro …
Peter Luschny's user avatar
5 votes
0 answers
186 views

The existence of $n$-sided cells in regular $m$-gons

For any integer $n >= 3$, does there exist a regular $m$-gon with all diagonals drawn containing a cell with $n$ sides? See A342222 and its cross-references. Regular polygon on the Wiki.           …
Peter Luschny's user avatar