Zobrazeno 1 - 10
of 15 835
pro vyhledávání: '"Yan X Zhang"'
Publikováno v:
Evolutionary and Institutional Economics Review. 18:21-44
In their foundational work, List and Pettit formalized the judgment aggregation framework and showed that the preference aggregation framework from social choice theory can be mapped into it, arguing that the reverse was not possible. We show that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b24f2534880e754ac48a2b7beeb5de58
https://doi.org/10.1007/s40844-021-00200-w
https://doi.org/10.1007/s40844-021-00200-w
Autor:
Kevin Iga, Yan X. Zhang
Publikováno v:
Advances in High Energy Physics, Vol 2016 (2016)
Adinkras are combinatorial objects developed to study (1-dimensional) supersymmetry representations. Recently, 2D Adinkras have been developed to study 2-dimensional supersymmetry. In this paper, we classify all 2D Adinkras, confirming a conjecture o
Externí odkaz:
https://doaj.org/article/3875f5a40e184a9597776e071d695787
Autor:
Yan X Zhang
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 27th..., Iss Proceedings (2015)
We explore the enumeration of some natural classes of graded posets, including $(2 + 2)$-avoiding graded posets, $(3 + 1)$-avoiding graded posets, $(2 + 2)$- and $(3 + 1)$-avoiding graded posets, and the set of all graded posets. As part of this stor
Externí odkaz:
https://doaj.org/article/c70e9bc7d1524f26b5e6899323e05ca6
Publikováno v:
PODC
It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes three mess
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::071c8fa4b58a297da1d0dd28af79f64b
https://doi.org/10.1145/3465084.3467924
https://doi.org/10.1145/3465084.3467924
Autor:
Yan X. Zhang
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
$\textit{Adinkras}$ are graphical tools created for the study of supersymmetry representations. Besides having inherent interest for physicists, the study of adinkras has already shown connections with coding theory and Clifford algebras. Furthermore
Externí odkaz:
https://doaj.org/article/ea4021ec4fa94a0ab73f0f57e70f256a
Autor:
Joel Lewis Brewster, Yan X Zhang
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012)
The notion of (3+1)-avoidance appears in many places in enumerative combinatorics, but the natural goal of enumerating all (3+1)-avoiding posets remains open. In this paper, we enumerate \emphgraded (3+1)-avoiding posets. Our proof consists of a numb
Externí odkaz:
https://doaj.org/article/d4b44c8e773f4745b803910109e032ca
Autor:
Yan X Zhang
Publikováno v:
Notices of the American Mathematical Society. 68:1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c86fad880c66d376812ea81cb3fd968
https://doi.org/10.1090/noti2365
https://doi.org/10.1090/noti2365
Adinkras are combinatorial objects developed to study supersymmetry representations. Gates et al. introduced the "gadget" as a function of pairs of adinkras, obtaining some mysterious results for $(n=4, k=1)$ adinkras with computer-aided computation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d24e2be41d01144cb55c8bfd6f15b99f
http://arxiv.org/abs/1810.05545
http://arxiv.org/abs/1810.05545
Autor:
Yan X Zhang
In the study of supersymmetry in one dimension, various works enumerate sets of generators of garden algebras $GR(d,N)$ (and equivalently, valise Adinkras) for special cases $N = d = 4$ and $N = d = 8$, using group-theoretic methods and computer comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f63b78a03401d67a2e27a45728c71013
http://arxiv.org/abs/1801.02678
http://arxiv.org/abs/1801.02678
Publikováno v:
SIAM Journal on Discrete Mathematics. 29:615-630
The parallel chip-firing game is an automaton on graphs in which vertices "fire" chips to their neighbors when they have enough chips to do so. The game is always periodic, and we concern ourselves with the firing sequences of vertices. We introduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2d1ffd0580329a7b54543bd299922b0
https://doi.org/10.1137/130933770
https://doi.org/10.1137/130933770