Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Jeffrey Liese"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AK,..., Iss Proceedings (2009)
Let $P$ be a partially ordered set and consider the free monoid $P^{\ast}$ of all words over $P$. If $w,w' \in P^{\ast}$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^{\ast}$ by letting $u
Externí odkaz:
https://doaj.org/article/6b56060e3a9148a49d4d9e446434cd8c
Autor:
Kathryn Kelly, Jeffrey Liese
Publikováno v:
Mathematics Magazine. 95:205-219
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f3ef156f94a572b59d25c61e2718aaa
https://doi.org/10.1080/0025570x.2022.2055334
https://doi.org/10.1080/0025570x.2022.2055334
In \cite{HRW15}, Haglund, Remmel, Wilson state a conjecture which predicts a purely combinatorial way of obtaining the symmetric function $\Delta_{e_k}e_n$. It is called the Delta Conjecture. It was recently proved in \cite{GHRY} that the Delta Conje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67586f26954d1d9320287db90fbd49cf
http://arxiv.org/abs/1801.07385
http://arxiv.org/abs/1801.07385
Publikováno v:
Annals of Combinatorics. 19:337-361
Let \({\mathcal{S} = (s_1, s_2, \ldots)}\) be any sequence of nonnegative integers and let \({{S_{k} = \sum_{i=1}^k} {s_i}}\).We then define the falling (rising) factorials relative to \({\mathcal{S}}\) by setting \({(x)\downarrow_{k, \mathcal{S}} =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10d0e639ac87d1bb975c5cec78c70cdd
https://doi.org/10.1007/s00026-015-0268-7
https://doi.org/10.1007/s00026-015-0268-7
Autor:
Jeffrey Liese, Sergey Kitaev
Publikováno v:
Discrete Mathematics. 313:1515-1531
The notion of a mesh pattern was introduced recently, but it has already proved to be a useful tool for description purposes related to sets of permutations. In this paper we study eight mesh patterns of small lengths. In particular, we link avoidanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7dffc50f1c7eb35b39babcce0e19d596
https://doi.org/10.1016/j.disc.2013.03.017
https://doi.org/10.1016/j.disc.2013.03.017
Autor:
Jeffrey Liese, Jeffrey B. Remmel
Publikováno v:
Annals of Combinatorics. 14:123-141
Given a permutation τ of length j, we say that a permutation σ has a τ-match starting at position i, if the elements in positions i, i+1, . . . , i+j−1 in σ have the same relative order as the elements of τ. We have been able to take advantage
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::013d88fc3425ffd62df0df491771a37e
https://doi.org/10.1007/s00026-010-0049-2
https://doi.org/10.1007/s00026-010-0049-2
Autor:
Jeffrey Liese
Publikováno v:
Annals of Combinatorics. 11:481-506
Given a permutation τ of length j, we say that a permutation σ has a τ-match starting at position i, if the elements in position i, i + 1, ... , i + j − 1 in σ have the same relative order as the elements of τ. If \(\Upsilon\) is the set of pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61f62c6feb461dbd039d1e2c3ed42fe4
https://doi.org/10.1007/s00026-007-0331-0
https://doi.org/10.1007/s00026-007-0331-0
Publikováno v:
SPIE Proceedings.
Small xed-wing UAS (SUAS) such as Raven and Unicorn have limited power, speed, and maneuverability. Their missions can be dramatically hindered by environmental conditions (wind, terrain), obstructions (buildings, trees) blocking clear line of sight
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2e8d25ad666ad8fda4a51437d659819
https://doi.org/10.1117/12.884314
https://doi.org/10.1117/12.884314
Publikováno v:
The Electronic Journal of Combinatorics. 16
Let $P$ be a partially ordered set and consider the free monoid $P^{\ast}$ of all words over $P$. If $w,w' \in P^{\ast}$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^{\ast}$ by letting $u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::193c53bfb820d55d8495dd91f369e1f1
https://doi.org/10.37236/88
https://doi.org/10.37236/88
Publikováno v:
The Electronic Journal of Combinatorics. 16
Given sets $X$ and $Y$ of positive integers and a permutation $\sigma = \sigma_1 \sigma_2 \cdots \sigma_n \in S_n$, an $(X,Y)$-descent of $\sigma$ is a descent pair $\sigma_i > \sigma_{i+1}$ whose "top" $\sigma_i$ is in $X$ and whose "bottom" $\sigma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a97c381d87a371094a8f2ee3cc51b868
https://doi.org/10.37236/200
https://doi.org/10.37236/200