English
Related papers

Related papers: Intersection numbers on fibrations and Catalan num…

200 papers

This paper establishes an interesting link between $k$th price auctions and Catalan numbers by showing that for distributions that have linear density, the bid function at any symmetric, increasing equilibrium of a $k$th price auction with…

Theoretical Economics · Economics 2021-08-10 Abdel-Hameed Nawar , Debapriya Sen

As it is well known, one can define an abelian group on the points of an elliptic curve, using the so called chord-tangent law \cite{dale}, and a chosen point. However, that very chord-tangent law allows us to define a rather more obscure…

Algebraic Geometry · Mathematics 2022-01-17 Ilia Pirashvili

We investigate the quotient ring $R$ of the ring of formal power series $\Q[[x_1,x_2,...]]$ over the closure of the ideal generated by non-constant quasi-\break symmetric functions. We show that a Hilbert basis of the quotient is naturally…

Combinatorics · Mathematics 2016-11-08 Jean-Christophe Aval , Nantel Bergeron

Convection structures in binary fluid mixtures are investigated for positive Soret coupling in the driving regime where solutal and thermal contributions to the buoyancy forces compete. Bifurcation properties of stable and unstable…

patt-sol · Physics 2009-10-31 Ch. Jung , B. Huke , M. Luecke

A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…

Combinatorics · Mathematics 2018-07-27 Robert G. Donnelly , Molly W. Dunkum , Courtney George , Stefan Schnake

The lonely singles sequence represents the number of noncrossing partitions of the finite set {1,. .. , n} in which no pair of singletons {i} and {j} can be merged into the pair {i, j} so that the partition stays noncrossing. The…

Combinatorics · Mathematics 2024-02-13 Julien Rouyer , Alain Ninet

The stable and unstable manifolds of an invariant set of a piecewise-smooth map are themselves piecewise-smooth. Consequently, as parameters of a piecewise-smooth map are varied, an invariant set can develop a homoclinic connection when its…

Dynamical Systems · Mathematics 2016-08-03 David J. W. Simpson

We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial…

Combinatorics · Mathematics 2021-10-25 Nickolas Hein , Jia Huang

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

Combinatorics · Mathematics 2020-11-17 Olivia Nabawanda , Fanja Rakotondrajao

While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and…

Combinatorics · Mathematics 2023-01-20 Christine Bessenrodt , Chris Bowman

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

Number Theory · Mathematics 2016-02-16 Pedro J. Miana , Hideyuki Ohtsuka , Natalia Romero

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

Combinatorics · Mathematics 2014-01-28 Mark Shattuck

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

We compute an asymptotic expression for the Arakelov self-intersection number of the relative dualizing sheaf of Edixhoven's minimal regular model for the modular curve $X_0(p^2)$ over $\mathbb{Q}$. The computation of the self-intersection…

Number Theory · Mathematics 2021-04-02 Debargha Banerjee , Diganta Borah , Chitrabhanu Chaudhuri

A multi-cube method is developed for solving systems of elliptic and hyperbolic partial differential equations numerically on manifolds with arbitrary spatial topologies. It is shown that any three-dimensional manifold can be represented as…

Computational Physics · Physics 2015-06-11 Lee Lindblom , Bela Szilagyi

The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence…

Group Theory · Mathematics 2014-11-11 Mahan Mj , Peter Scott , Gadde Swarup

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…

Combinatorics · Mathematics 2014-07-15 Toufik Mansour , Mark Shattuck

We consider a rational surface with a relatively minimal fibration. Picard number of a such fibred surface is bounded in terms of the genus of a general fibre. When Picard number is the maximum for any given genus, we characterize a such…

Algebraic Geometry · Mathematics 2010-06-28 Shinya Kitagawa

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…

Combinatorics · Mathematics 2008-11-03 Jean-Christophe Aval
‹ Prev 1 3 4 5 6 7 10 Next ›