Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Brian Y. Sun"'
Publikováno v:
Mathematics, Vol 8, Iss 5, p 778 (2020)
A universal cycle, or u-cycle, for a given set of words is a circular word that contains each word from the set exactly once as a contiguous subword. The celebrated de Bruijn sequences are a particular case of such a u-cycle, where a set in question
Externí odkaz:
https://doaj.org/article/d43936b8ccfa488cb01eb05e1e93a2d5
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Combinatorics (2017)
A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist for any $
Externí odkaz:
https://doaj.org/article/9f352357fbb2482b98858b17c4afd2e0
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Combinatorics (2016)
In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric) alternative
Externí odkaz:
https://doaj.org/article/204a58e2952f4df09c639381f16e5009
Autor:
Brian Y. Sun
Publikováno v:
The Ramanujan Journal. 48:173-189
In recent years, we have witnessed numerous new results on divisibility properties concerning binomial sums. Many conjectures and results were proposed by Z.-W. Sun. Some of these conjectures were proved by himself, and also by some scholars such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c10b625fb1ff4208ad0d1c3a4209213
https://doi.org/10.1007/s11139-018-0001-3
https://doi.org/10.1007/s11139-018-0001-3
Publikováno v:
Journal of Inequalities and Applications, Vol 2016, Iss 1, Pp 1-9 (2016)
In this paper, we study the log-behavior of a new sequence $\{S_{n}\} _{n=0}^{\infty}$ , which was defined by Z-W Sun. We find that the sequence is log-convex by using the interlacing method. Additionally, we consider ratio log-behavior of $\{S_{n}\}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53644a149f3e8e5dd2a10850d2fe769c
http://link.springer.com/article/10.1186/s13660-016-1221-y
http://link.springer.com/article/10.1186/s13660-016-1221-y
Publikováno v:
Discrete Applied Mathematics. 213:60-70
A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\neq y$, alternate in $w$ if and only if $(x,y)\in E$. Halld\'{o}rsson et al.\ have shown that a graph is word-representable if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0228f3ddbd54ad11c85899249b67b370
https://doi.org/10.1016/j.dam.2016.05.025
https://doi.org/10.1016/j.dam.2016.05.025
Publikováno v:
Mathematics, Vol 8, Iss 778, p 778 (2020)
Mathematics
Volume 8
Issue 5
Mathematics
Volume 8
Issue 5
A universal cycle, or u-cycle, for a given set of words is a circular word that contains eachword from the set exactly once as a contiguous subword. The celebrated de Bruijn sequences are aparticular case of such a u-cycle, where a set in question is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9761a1a6370485f4871fec71dec6a73c
https://doi.org/10.3390/math8050778
https://doi.org/10.3390/math8050778
Autor:
Brian Y. Sun, Yingying Hu
Publikováno v:
Rocky Mountain J. Math. 48, no. 6 (2018), 2087-2097
In this paper, along the spirit of Greene, Nijenhuis and Wilf's probabilistic method for the classical hook-length formula for standard Young tableaux, we present a probabilistic proof of the hook-length formula for standard immaculate tableaux, whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05aceec138f7ff187f21eef1ec123a20
https://projecteuclid.org/euclid.rmjm/1543028454
https://projecteuclid.org/euclid.rmjm/1543028454
Autor:
Brian Y. Sun, Emily X. L. Gao
Publikováno v:
Results in Mathematics. 73
In the study of enumeration polynomials of signed permutations of rank n, which is known as a Coxeter group of type B, Chow and Ma found that alternating runs of up signed permutations are closely related to peaks and valleys of these permutations. N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::350f429bdc02f7849aead63d6db6a154
https://doi.org/10.1007/s00025-018-0840-7
https://doi.org/10.1007/s00025-018-0840-7
Autor:
Brian Y. Sun
Publikováno v:
Journal of Inequalities and Applications
Journal of Inequalities and Applications, Vol 2018, Iss 1, Pp 1-10 (2018)
Journal of Inequalities and Applications, Vol 2018, Iss 1, Pp 1-10 (2018)
It is known that the concept of ratio monotonicity is closely related to log-convexity and log-concavity. In this paper, by exploring the log-behavior properties of a new combinatorial sequence defined by Z.-W. Sun, we completely solve a conjecture o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9cfd704918e414909ecb8fcce9a5cca
http://europepmc.org/articles/PMC5784024
http://europepmc.org/articles/PMC5784024