scholarly journals On Plücker coordinates of a perfectly oriented planar network

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Kelli Talaska
Keyword(s):  
Positive Integer ◽  
Generating Functions ◽  
Weight Functions ◽  
Combinatorial Formula ◽  
Rational Map ◽  
Positive Weight ◽  
Integer Coefficients ◽  
Plücker Coordinates ◽  
Planar Network ◽  
International Audience

International audience Let $G$ be a perfectly oriented planar graph. Postnikov's boundary measurement construction provides a rational map from the set of positive weight functions on the edges of $G$ onto the appropriate totally nonnegative Grassmann cell. We establish an explicit combinatorial formula for Postnikov's map by expressing each Plücker coordinate of the image as a ratio of two polynomials in the edge weights, with positive integer coefficients. These polynomials are weight generating functions for certain subsets of edges in $G$.

scholarly journals Statistics on Lattice Walks and q-Lassalle Numbers

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Lenny Tevlin
Keyword(s):  
Positive Integer ◽  
Generating Function ◽  
Catalan Numbers ◽  
Binomial Coefficients ◽  
Integer Coefficients ◽  
Major Index ◽  
Lattice Walks ◽  
International Audience ◽  
The Difference ◽  
Positive Integers

International audience This paper contains two results. First, I propose a $q$-generalization of a certain sequence of positive integers, related to Catalan numbers, introduced by Zeilberger, see Lassalle (2010). These $q$-integers are palindromic polynomials in $q$ with positive integer coefficients. The positivity depends on the positivity of a certain difference of products of $q$-binomial coefficients.To this end, I introduce a new inversion/major statistics on lattice walks. The difference in $q$-binomial coefficients is then seen as a generating function of weighted walks that remain in the upper half-plan. Cet document contient deux résultats. Tout d’abord, je vous propose un $q$-generalization d’une certaine séquence de nombres entiers positifs, liés à nombres de Catalan, introduites par Zeilberger (Lassalle, 2010). Ces $q$-integers sont des polynômes palindromiques à $q$ à coefficients entiers positifs. La positivité dépend de la positivité d’une certaine différence de produits de $q$-coefficients binomial.Pour ce faire, je vous présente une nouvelle inversion/major index sur les chemins du réseau. La différence de $q$-binomial coefficients est alors considérée comme une fonction de génération de trajets pondérés qui restent dans le demi-plan supérieur.

scholarly journals Deodhar Elements in Kazhdan-Lusztig Theory

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Brant Jones
Keyword(s):  
Coxeter Groups ◽  
Pattern Avoidance ◽  
Weyl Groups ◽  
Schubert Varieties ◽  
Combinatorial Formula ◽  
Nous Obtenons ◽  
Integer Coefficients ◽  
Nous Montrons ◽  
International Audience ◽  
Lusztig Polynomials

International audience The Kazhdan-Lusztig polynomials for finite Weyl groups arise in representation theory as well as the geometry of Schubert varieties. It was proved very soon after their introduction that they have nonnegative integer coefficients, but no simple all positive interpretation for them is known in general. Deodhar has given a framework, which generally involves recursion, to express the Kazhdan-Lusztig polynomials in a very attractive form. We use a new kind of pattern-avoidance that can be defined for general Coxeter groups to characterize when Deodhar's algorithm yields a non-recursive combinatorial formula for Kazhdan-Lusztig polynomials $P_{x,w}(q)$ of finite Weyl groups. This generalizes results of Billey-Warrington which identified the $321$-hexagon-avoiding permutations, and Fan-Green which identified the fully-tight Coxeter groups. We also show that the leading coefficient known as $\mu (x,w)$ for these Kazhdan―Lusztig polynomials is always either $0$ or $1$. Finally, we generalize the simple combinatorial formula for the Kazhdan―Lusztig polynomials of the $321$-hexagon-avoiding permutations to the case when $w$ is hexagon avoiding and maximally clustered. Les polynômes de Kazhdan-Lusztig $P_{x,w}(q)$ des groupes de Weyl finis apparaissent en théorie des représentations, ainsi qu’en géométrie des variétés de Schubert. Il a été démontré peu après leur introduction qu’ils avaient des coefficients entiers positifs, mais on ne connaît toujours pas d’interprétation combinatoire simple de cette propriété dans le cas général. Deodhar a proposé un cadre donnant un algorithme, en général récursif, calculant des formules attractives pour les polynômes de Kazhdan-Lusztig. Billey-Warrington ont démontré que cet algorithme est non récursif lorsque$w$ évite les hexagones et les $321$ et qu’il donne des formules combinatoires simples. Nous introduisons une notion d’évitement de schémas dansles groupes de Coxeter quelconques nous permettant de généraliser les résultats de Billey-Warrington à tout groupe de Weyl fini. Nous montrons que le coefficient de tête $\mu (x,w)$ de ces polynômes de Kazhdan-Lusztig est toujours $0$ ou $1$. Cela généralise aussi des résultats de Fan-Greenqui identifient les groupes de Coxeter complètement serrés. Enfin, en type $A$, nous obtenons une classe plus large de permutations évitant la récursion.

scholarly journals A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids

10.37236/9435 ◽  
2020 ◽  
Vol 27 (4) ◽  
Author(s):  
Kyungyong Lee ◽  
George D. Nasr ◽  
Jamie Radcliffe
Keyword(s):  
Positive Integer ◽  
Negative Integer ◽  
Young Tableaux ◽  
Combinatorial Formula ◽  
Integer Coefficients ◽  
Lusztig Polynomials

Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a combinatorial formula for Kazhdan–Lusztig polynomials of $\rho$-removed uniform matroids, using skew Young Tableaux. Even for uniform matroids, our formula is new, gives manifestly positive integer coefficients, and is more manageable than known formulas.

scholarly journals Statistics for 3-letter patterns with repetitions in compositions

2016 ◽  
Vol Vol. 17 no. 3 (Combinatorics) ◽  
Author(s):  
Armend Shabani ◽  
Rexhep Gjergji
Keyword(s):  
Positive Integer ◽  
Linear Algebra ◽  
Generating Functions ◽  
International Audience ◽  
Positive Integers

International audience A composition $\pi = \pi_1 \pi_2 \cdots \pi_m$ of a positive integer $n$ is an ordered collection of one or more positive integers whose sum is $n$. The number of summands, namely $m$, is called the number of parts of $\pi$. Using linear algebra, we determine formulas for generating functions that count compositions of $n$ with $m$ parts, according to the number of occurrences of the subword pattern $\tau$, and according to the sum, over all occurrences of $\tau$, of the first integers in their respective occurrences, where $\tau$ is any pattern of length three with exactly 2 distinct letters.

scholarly journals Some problems of Analytic number theory IV

2002 ◽  
Vol Volume 25 ◽  
Author(s):  
R Balasubramanian ◽  
K Ramachandra
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Asymptotic Formula ◽  
Kernel Function ◽  
Generating Functions ◽  
Analytic Number Theory ◽  
Second Order ◽  
Analytic Number ◽  
International Audience ◽  
Error Terms

International audience In the present paper, we use Ramachandra's kernel function of the second order, namely ${\rm Exp} ((\sin z)^2)$, which has some advantages over the earlier kernel ${\rm Exp} (z^{4a+2})$ where $a$ is a positive integer. As an outcome of the new kernel we are able to handle $\Omega$-theorems for error terms in the asymptotic formula for the summatory function of the coefficients of generating functions of the ${\rm Exp}(\zeta(s)), {\rm Exp\,Exp}(\zeta(s))$ and also of the type ${\rm Exp\,Exp}((\zeta(s))^{\frac{1}{2}})$.

scholarly journals Area of Brownian Motion with Generatingfunctionology

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Michel Nguyên Thê
Keyword(s):  
Brownian Motion ◽  
Random Walks ◽  
Generating Functions ◽  
Limit Distributions ◽  
Dyck Paths ◽  
Different Types ◽  
International Audience

International audience This paper gives a survey of the limit distributions of the areas of different types of random walks, namely Dyck paths, bilateral Dyck paths, meanders, and Bernoulli random walks, using the technology of generating functions only.

scholarly journals Finite Eulerian posets which are binomial or Sheffer

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Hoda Bidkhori
Keyword(s):  
Generating Functions ◽  
Complete Classification ◽  
International Audience ◽  
Original Question ◽  
Eulerian Posets

International audience In this paper we study finite Eulerian posets which are binomial or Sheffer. These important classes of posets are related to the theory of generating functions and to geometry. The results of this paper are organized as follows: (1) We completely determine the structure of Eulerian binomial posets and, as a conclusion, we are able to classify factorial functions of Eulerian binomial posets; (2) We give an almost complete classification of factorial functions of Eulerian Sheffer posets by dividing the original question into several cases; (3) In most cases above, we completely determine the structure of Eulerian Sheffer posets, a result stronger than just classifying factorial functions of these Eulerian Sheffer posets. We also study Eulerian triangular posets. This paper answers questions posed by R. Ehrenborg and M. Readdy. This research is also motivated by the work of R. Stanley about recognizing the \emphboolean lattice by looking at smaller intervals. Nous étudions les ensembles partiellement ordonnés finis (EPO) qui sont soit binomiaux soit de type Sheffer (deux notions reliées aux séries génératrices et à la géométrie). Nos résultats sont les suivants: (1) nous déterminons la structure des EPO Euleriens et binomiaux; nous classifions ainsi les fonctions factorielles de tous ces EPO; (2) nous donnons une classification presque complète des fonctions factorielles des EPO Euleriens de type Sheffer; (3) dans la plupart de ces cas, nous déterminons complètement la structure des EPO Euleriens et Sheffer, ce qui est plus fort que classifier leurs fonctions factorielles. Nous étudions aussi les EPO Euleriens triangulaires. Cet article répond à des questions de R. Ehrenborg and M. Readdy. Il est aussi motivé par le travail de R. Stanley sur la reconnaissance du treillis booléen via l'étude des petits intervalles.

scholarly journals On the 2-adic order of Stirling numbers of the second kind and their differences

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Tamás Lengyel
Keyword(s):  
Positive Integer ◽  
Stirling Numbers ◽  
Bell Polynomials ◽  
Binary Representation ◽  
Exact Order ◽  
Special Cases ◽  
International Audience ◽  
The Difference ◽  
Divisibility Properties ◽  
Positive Integers

International audience Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively. De Wannemacker recently proved for the Stirling numbers of the second kind that $\nu_2(S(2^n,k))=d(k)-1, 1\leq k \leq 2^n$. Here we prove that $\nu_2(S(c2^n,k))=d(k)-1, 1\leq k \leq 2^n$, for any positive integer $c$. We improve and extend this statement in some special cases. For the difference, we obtain lower bounds on $\nu_2(S(c2^{n+1}+u,k)-S(c2^n+u,k))$ for any nonnegative integer $u$, make a conjecture on the exact order and, for $u=0$, prove part of it when $k \leq 6$, or $k \geq 5$ and $d(k) \leq 2$. The proofs rely on congruential identities for power series and polynomials related to the Stirling numbers and Bell polynomials, and some divisibility properties.

scholarly journals ON THE NUMBER OF REPRESENTATIONS OF INTEGERS BY CERTAIN QUADRATIC FORMS

2008 ◽  
Vol 78 (1) ◽  
pp. 129-140 ◽  
Author(s):  
SHAUN COOPER
Keyword(s):  
Positive Integer ◽  
Generating Functions ◽  
Quadratic Forms ◽  
Triangular Numbers ◽  
Representations Of Integers

AbstractGenerating functions are used to derive formulas for the number of representations of a positive integer by each of the quadratic forms x12+x22+x32+2x42, x12+2x22+2x32+2x42, x12+x22+2x32+4x42 and x12+2x22+4x32+4x42. The formulas show that the number of representations by each form is always positive. Some of the analogous results involving sums of triangular numbers are also given.

Arithmetic properties for Fu's 9 dots bracelet partitions

2015 ◽  
Vol 11 (04) ◽  
pp. 1063-1072
Author(s):  
Olivia X. M. Yao
Keyword(s):  
Positive Integer ◽  
Generating Functions ◽  
Arithmetic Properties ◽  
Powers Of 2

The notion of Fu's k dots bracelet partitions was introduced by Shishuo Fu. For any positive integer k, let 𝔅k(n) denote the number of Fu's k dots bracelet partitions of n. Fu also proved several congruences modulo primes and modulo powers of 2. Recently, Radu and Sellers extended the set of congruences proven by Fu by proving three congruences modulo squares of primes for 𝔅5(n), 𝔅7(n) and 𝔅11(n). More recently, Cui and Gu, and Xia and the author derived a number of congruences modulo powers of 2 for 𝔅5(n). In this paper, we prove four congruences modulo 2 and two congruences modulo 4 for 𝔅9(n) by establishing the generating functions of 𝔅9(An+B) modulo 4 for some values of A and B.

Sign in / Sign up

Export Citation Format

Share Document