Zobrazeno 1 - 10
of 286
pro vyhledávání: '"B Remmel"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Combinatorics (2022)
We define and study positional marked patterns, permutations $\tau$ where one of elements in $\tau$ is underlined. Given a permutation $\sigma$, we say that $\sigma$ has a $\tau$-match at position $i$ if $\tau$ occurs in $\sigma$ in such a way that $
Externí odkaz:
https://doaj.org/article/6122b070ae864e4b91a7a818bdd46068
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
We conjecture two combinatorial interpretations for the symmetric function ∆eken, where ∆f is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations can be seen as generalizat
Externí odkaz:
https://doaj.org/article/01de357c561b4522a7673473fcd8801e
Autor:
Dun Qiu, Jeffrey B. Remmel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 2, Permutation..., Iss Permutation Patterns (2018)
Given a permutation $\sigma = \sigma_1 \ldots \sigma_n$ in the symmetric group $\mathcal{S}_{n}$, we say that $\sigma_i$ matches the quadrant marked mesh pattern $\mathrm{MMP}(a,b,c,d)$ in $\sigma$ if there are at least $a$ points to the right of $\s
Externí odkaz:
https://doaj.org/article/2db654e8a0084d589d2751b229d7bb66
Autor:
Quang T. Bach, Jeffrey B. Remmel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 2, Permutation..., Iss Permutation Patterns (2017)
Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote the numbe
Externí odkaz:
https://doaj.org/article/74e9082758904c88be8939a90e0cce05
Autor:
Ran Pan, Jeffrey B. Remmel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 2, Permutation..., Iss Permutation Patterns (2016)
A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping pattern
Externí odkaz:
https://doaj.org/article/2b6a81db637744b1b6991aeee0a80222
Publikováno v:
Theory of Computing Systems. 64:1110-1139
We study automatic equivalence and nested equivalence structures. The goal is to compare and contrast these automatic structures with computable equivalence and nested equivalence structures. Equivalence structures $\mathcal {A}$ may be characterized
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b4da2f6bcd1a1b7e896f12906887ed6
https://doi.org/10.1007/s00224-020-09974-9
https://doi.org/10.1007/s00224-020-09974-9
Publikováno v:
Journal of Logic and Computation. 30:107-156
We study the recognition problem in the metaprogramming of finite normal predicate logic programs. That is, let $\mathcal{L}$ be a computable first-order predicate language with infinitely many constant symbols and infinitely many $n$-ary predicate s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be8e4fd93e237fd664df3511ac387b2d
https://doi.org/10.1093/logcom/exaa005
https://doi.org/10.1093/logcom/exaa005
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 4 (2014)
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE fun
Externí odkaz:
https://doaj.org/article/1c87cf73aa5c4752ac4bb27d07fae3e2
Publikováno v:
Discrete Mathematics. 342:2966-2983
In the papers (Benoumhani 1996;1997), Benoumhani defined two polynomials F m , n , 1 ( x ) and F m , n , 2 ( x ) . Then, he defined A m ( n , k ) and B m ( n , k ) to be the polynomials satisfying F m , n , 1 ( x ) = ∑ k = 0 n A m ( n , k ) x n −
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfe9067e41dd446ff9d287960ea5d19d
https://doi.org/10.1016/j.disc.2019.05.026
https://doi.org/10.1016/j.disc.2019.05.026
Publikováno v:
Annals of Combinatorics. 23:317-333
In Haglund et al. (Trans. Amer. Math. Soc. 370(6):4029–4057, 2018), Haglund, Remmel and Wilson introduce a conjecture which gives a combinatorial prediction for the result of applying a certain operator to an elementary symmetric function. This ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de3df53114f44a476efa07b2295b0c0f
https://doi.org/10.1007/s00026-019-00426-x
https://doi.org/10.1007/s00026-019-00426-x