Zobrazeno 1 - 10
of 32
pro vyhledávání: '"05A15, 06A07"'
Autor:
Elizalde, Sergi, Lafrenière, Nadia, Lewis, Joel Brewster, McNicholas, Erin, Striker, Jessica, Welch, Amanda
We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets of trunca
Externí odkaz:
http://arxiv.org/abs/2412.16368
Autor:
Yeats, Karen
The causal set theory d'Alembertian has rational coefficients for which alternating expressions are known. Here, a combinatorial interpretation of these numbers is given.
Comment: 13 pages
Comment: 13 pages
Externí odkaz:
http://arxiv.org/abs/2412.14036
Autor:
Beck, Matthias, Kolhatkar, Sampada
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 25:2, Combinatorics (November 17, 2023) dmtcs:9595
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this notion to
Externí odkaz:
http://arxiv.org/abs/2111.09384
Interval parking functions (IPFs) are a generalization of ordinary parking functions in which each car is willing to park only in a fixed interval of spaces. Each interval parking function can be expressed as a pair $(a,b)$, where $a$ is a parking fu
Externí odkaz:
http://arxiv.org/abs/2006.09321
Autor:
Matthias Beck, Sampada Kolhatkar
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2023)
The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this notion to
Externí odkaz:
https://doaj.org/article/af46a92b43b040688318aed72f8fa5fd
We call an interval $[x,y]$ in a poset {\em small} if $y$ is the join of some elements covering $x$. In this paper, we study the chains of paths from a given arbitrary (binary) path $P$ to the maximum path having only small intervals. More precisely,
Externí odkaz:
http://arxiv.org/abs/1911.10883
Autor:
Dwyer, Tim, Elizalde, Sergi
Two permutations $\pi$ and $\tau$ are c-Wilf equivalent if, for each $n$, the number of permutations in $S_n$ avoiding $\pi$ as a consecutive pattern (i.e., in adjacent positions) is the same as the number of those avoiding $\tau$. In addition, $\pi$
Externí odkaz:
http://arxiv.org/abs/1801.08262
We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\pi$ to be $k$-pass sortable if $\pi
Externí odkaz:
http://arxiv.org/abs/1704.04288
Autor:
Kim, Jang Soo, Stanton, Dennis
A combinatorial study of multiple $q$-integrals is developed. This includes a $q$-volume of a convex polytope, which depends upon the order of $q$-integration. A multiple $q$-integral over an order polytope of a poset is interpreted as a generating f
Externí odkaz:
http://arxiv.org/abs/1608.03342
Autor:
Hudson, Robin, Pei, Yuchen
We study the family of causal double product integrals \begin{equation*} \prod_{a < x < y < b}\left(1 + i{\lambda \over 2}(dP_x dQ_y - dQ_x dP_y) + i {\mu \over 2}(dP_x dP_y + dQ_x dQ_y)\right) \end{equation*} where $P$ and $Q$ are the mutually nonco
Externí odkaz:
http://arxiv.org/abs/1506.04294