scholarly journals A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials

2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Travis Herbranson ◽  
Don Rawlings
Keyword(s):  
Sequential Search ◽  
Symmetric Polynomials ◽  
Expected Number ◽  
Eulerian Polynomials ◽  
International Audience ◽  
Player Game

International audience The distribution for the number of searches needed to find k of n lost objects is expressed in terms of a refinement of the q-Eulerian polynomials, for which formulae are developed involving homogeneous symmetric polynomials. In the case when k=n and the find probability remains constant, relatively simple and efficient formulas are obtained.From our main theorem, we further (1) deduce the inverse absorption distribution and (2) determine the expected number of times the survivor pulls the trigger in an n-player game of Russian roulette.

scholarly journals Stochastic Flips on Dimer Tilings

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Thomas Fernique ◽  
Damien Regnault
Keyword(s):  
Fixed Point ◽  
Markov Process ◽  
Upper Bound ◽  
Numerical Experiments ◽  
Triangular Grid ◽  
Expected Number ◽  
Worst Case ◽  
Average Case ◽  
International Audience

International audience This paper introduces a Markov process inspired by the problem of quasicrystal growth. It acts over dimer tilings of the triangular grid by randomly performing local transformations, called $\textit{flips}$, which do not increase the number of identical adjacent tiles (this number can be thought as the tiling energy). Fixed-points of such a process play the role of quasicrystals. We are here interested in the worst-case expected number of flips to converge towards a fixed-point. Numerical experiments suggest a $\Theta (n^2)$ bound, where $n$ is the number of tiles of the tiling. We prove a $O(n^{2.5})$ upper bound and discuss the gap between this bound and the previous one. We also briefly discuss the average-case.

scholarly journals The absence of a pattern and the occurrences of another

2010 ◽  
Vol Vol. 12 no. 2 ◽  
Author(s):  
Miklós Bóna
Keyword(s):  
Exact Enumeration ◽  
Expected Number ◽  
Permutation Pattern ◽  
International Audience

International audience Following a question of J. Cooper, we study the expected number of occurrences of a given permutation pattern q in permutations that avoid another given pattern r. In some cases, we find the pattern that occurs least often, (resp. most often) in all r-avoiding permutations. We also prove a few exact enumeration formulae, some of which are surprising.

scholarly journals Paths of specified length in random k-partite graphs

2001 ◽  
Vol Vol. 4 no. 2 ◽  
Author(s):  
C.R. Subramanian
Keyword(s):  
Random Graphs ◽  
Expected Number ◽  
Vertex Set ◽  
International Audience ◽  
Simple Paths ◽  
Positive Integers

International audience Fix positive integers k and l. Consider a random k-partite graph on n vertices obtained by partitioning the vertex set into V_i, (i=1, \ldots,k) each having size Ω (n) and choosing each possible edge with probability p. Consider any vertex x in any V_i and any vertex y. We show that the expected number of simple paths of even length l between x and y differ significantly depending on whether y belongs to the same V_i (as x does) or not. A similar phenomenon occurs when l is odd. This result holds even when k,l vary slowly with n. This fact has implications to coloring random graphs. The proof is based on establishing bijections between sets of paths.

scholarly journals Upper bounds on the non-3-colourability threshold of random graphs

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Nikolaos Fountoulakis ◽  
Colin McDiarmid
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
Upper Bounds ◽  
Average Degree ◽  
Expected Number ◽  
International Audience ◽  
Full Analysis ◽  
A Minor ◽  
Minor Improvement

International audience We present a full analysis of the expected number of 'rigid' 3-colourings of a sparse random graph. This shows that, if the average degree is at least 4.99, then as n → ∞ the expected number of such colourings tends to 0 and so the probability that the graph is 3-colourable tends to 0. (This result is tight, in that with average degree 4.989 the expected number tends to ∞.) This bound appears independently in Kaporis \textitet al. [Kap]. We then give a minor improvement, showing that the probability that the graph is 3-colourable tends to 0 if the average degree is at least 4.989.

scholarly journals A categorification of the chromatic symmetric polynomial

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Radmila Sazdanović ◽  
Martha Yip
Keyword(s):  
Symmetric Function ◽  
Symmetric Polynomial ◽  
Chromatic Polynomial ◽  
Khovanov Homology ◽  
Symmetric Polynomials ◽  
Nous Obtenons ◽  
Combinatorial Properties ◽  
International Audience ◽  
Chromatic Symmetric Function ◽  
Frobenius Series

International audience The Stanley chromatic polynomial of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology $H$<sub>*</sub>($G$) of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to the chromatic symmetric function at $q=t=1$. We also obtain analogues of several familiar properties of the chromatic symmetric polynomials in terms of homology. Le polynôme chromatique symétrique d’un graphe $G$ est une généralisation par une fonction symétrique du polynôme chromatique, et possède des propriétés combinatoires intéressantes. Nous appliquons les techniques de l’homologie de Khovanov pour construire une homologie $H$<sub>*</sub>($G$) de modules gradués $S_n$, dont la série bigraduée de Frobeniusse $Frob_G(q,t)$ réduit au polynôme chromatique symétrique à $q=t=1$. Nous obtenons également des analogies pour plusieurs propriétés connues des polynômes chromatiques en termes d’homologie.

scholarly journals Invariant and coinvariant spaces for the algebra of symmetric polynomials in non-commuting variables

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
François Bergeron ◽  
Aaron Lauve
Keyword(s):  
Tensor Product ◽  
Symmetric Group ◽  
Hopf Algebras ◽  
Symmetric Polynomials ◽  
Reflection Groups ◽  
Invariant Polynomials ◽  
Product Decomposition ◽  
Combinatorial Hopf Algebras ◽  
Produit Tensoriel ◽  
International Audience

International audience We analyze the structure of the algebra $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ of symmetric polynomials in non-commuting variables in so far as it relates to $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$, its commutative counterpart. Using the "place-action'' of the symmetric group, we are able to realize the latter as the invariant polynomials inside the former. We discover a tensor product decomposition of $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ analogous to the classical theorems of Chevalley, Shephard-Todd on finite reflection groups. In the case $|\mathbf{x}|= \infty$, our techniques simplify to a form readily generalized to many other familiar pairs of combinatorial Hopf algebras. Nous analysons la structure de l'algèbre $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ des polynômes symétriques en des variables non-commutatives pour obtenir des analogues des résultats classiques concernant la structure de l'anneau $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ des polynômes symétriques en des variables commutatives. Plus précisément, au moyen de "l'action par positions'', on réalise $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ comme sous-module de $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$. On découvre alors une nouvelle décomposition de $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ comme produit tensoriel, obtenant ainsi un analogue des théorèmes classiques de Chevalley et Shephard-Todd. Dans le cas $|\mathbf{x}|= \infty$, nos techniques se simplifient en une forme aisément généralisables à beaucoup d'autres paires d'algèbres de Hopf familières.

scholarly journals The Prism tableau model for Schubert polynomials

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Anna Weigandt ◽  
Alexander Yong
Keyword(s):  
Young Tableau ◽  
Schubert Varieties ◽  
Symmetric Polynomials ◽  
Schubert Polynomials ◽  
International Audience

International audience The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1; x2; : : :]. We suggest the prism tableau model for these polynomials. A novel aspect of this alternative to earlier results is that it directly invokes semistandard tableaux; it does so as part of a colored tableau amalgam. In the Grassmannian case, a prism tableau with colors ignored is a semistandard Young tableau. Our arguments are developed from the Gr¨obner geometry of matrix Schubert varieties.

scholarly journals Les polynômes eul\IeC èriens stables de type B

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Mirkó Visontai ◽  
Nathan Williams
Keyword(s):  
Linear Operator ◽  
Type B ◽  
Multivariate Polynomial ◽  
Eulerian Polynomial ◽  
Eulerian Polynomials ◽  
Signed Permutations ◽  
International Audience ◽  
Multiple Variables ◽  
Real Stability

International audience We give a multivariate analog of the type B Eulerian polynomial introduced by Brenti. We prove that this multivariate polynomial is stable generalizing Brenti's result that every root of the type B Eulerian polynomial is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability—a generalization of real-rootedness to polynomials in multiple variables. The key is that our refined multivariate Eulerian polynomials satisfy a recurrence given by a stability-preserving linear operator. Nous prèsentons un raffinement multivariè d'un polynôme eulèrien de type B dèfini par Brenti. En prouvant que ce polynôme est stable nous gènèralisons un rèsultat de Brenti selon laquel chaque racine du polynôme eulèrien de type B est rèelle. Notre preuve combine un raffinement de la statistique des descentes pour les permutations signèes avec la stabilitè—une gènèralisation de la propriètè d'avoir uniquement des racines rèelles aux polynômes en plusieurs variables. La connexion est que nos polynômes eulèriens raffinès satisfont une rècurrence donnèe par un opèrateur linèaire qui prèserve la stabilitè.

scholarly journals Yamanouchi toppling

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Robert Cori ◽  
Domenico Senato ◽  
Pasquale Petrullo
Keyword(s):  
Connected Graph ◽  
Random Variable ◽  
Symmetric Polynomials ◽  
Chip Firing ◽  
International Audience ◽  
Orthogonal Systems ◽  
Cette Action ◽  
Donne Lieu ◽  
General Method

International audience We study an extension of the chip-firing game. A given set of admissible moves, called Yamanouchi moves, allows the player to pass from a starting configuration $\alpha$ to a further configuration $\beta$. This can be encoded via an action of a certain group, the toppling group, associated with each connected graph. This action gives rise to a generalization of Hall-Littlewood symmetric polynomials and a new combinatorial basis for them. Moreover, it provides a general method to construct all orthogonal systems associated with a given random variable. On s’intéresse ici à une variante du modèle combinatoire du tas de sable. Un ensemble particulier de suites d’éboulements, les éboulements de Yamanouchi est défini. Les éléments de cet ensemble permettent de passer d’une configuration à une autre, ceci peut être représenté par l’action d’un certain groupe, le groupe des éboulements que l’on peut associer à tout graphe connexe. Cette action donne lieu à une généralisation de polynômes symétriques de Hall-Littlewood et un nouveau champ combinatoire pour ceux-ci. Une extension à la construction d’autres familles de polynômes orthogonaux est proposée.

Sign in / Sign up

Export Citation Format

Share Document