Zobrazeno 1 - 10
of 1 365
pro vyhledávání: '"E. Sagan"'
Autor:
Yu. Samoilova, E. Sagan, O. Oleynik, D. Kudlay, M. Matveeva, D. Podchinenova, M. Kovarenko, I. Vorozhtsova, O. Pavlenko
Publikováno v:
Vrach. 33:41-45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7dcd938fe37b67ab27101b9e949dcf53
https://doi.org/10.29296/25877305-2022-08-08
https://doi.org/10.29296/25877305-2022-08-08
Autor:
Sergi Elizalde, Bruce E. Sagan
Publikováno v:
Annals of Combinatorics.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb5d5928731f5696f2e41ca4e70eeab3
https://doi.org/10.1007/s00026-022-00600-8
https://doi.org/10.1007/s00026-022-00600-8
Autor:
E. Sagan
Publikováno v:
Ìнформаційні технології в освіті, Iss 18, Pp 105-110 (2014)
A lot of educational projects get no further development primarily due to the lack of competent academic staff. It is not only the professional knowledge, abilities and skills, but also the ability to perceive educational innovations and ability to i
Externí odkaz:
https://doaj.org/article/15c2963b91364bbca60e84087e06beef
Autor:
Bruce E. Sagan, Jonathan Bloom
Publikováno v:
Annals of Combinatorics. 24:337-361
Let $${{\mathfrak {S}}}_n$$ be the nth symmetric group. Given a set of permutations $$\Pi $$, we denote by $${{\mathfrak {S}}}_n(\Pi )$$ the set of permutations in $${{\mathfrak {S}}}_n$$ which avoid $$\Pi $$ in the sense of pattern avoidance. Consid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c1e92da391da69a5e3b7284ac51ff8f
https://doi.org/10.1007/s00026-020-00492-6
https://doi.org/10.1007/s00026-020-00492-6
Publikováno v:
Algebraic Combinatorics. 3:365-388
Given a set of permutations Pi, let S_n(Pi) denote the set of permutations in the symmetric group S_n that avoid every element of Pi in the sense of pattern avoidance. Given a subset S of {1,...,n-1}, let F_S be the fundamental quasisymmetric functio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::650f800a90e7f92b72af1363f1ee562d
https://doi.org/10.5802/alco.96
https://doi.org/10.5802/alco.96
Autor:
Bruce E. Sagan
Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four Color Theor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::421ca4f685f35cd188a7fd14c1006371
http://arxiv.org/abs/2106.03647
http://arxiv.org/abs/2106.03647
Autor:
Rachel Domagalski, Jinting Liang, Quinn Minnich, Bruce E. Sagan, Jamie Schmidt, Alexander Sietsema
Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the well-studied peak se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24e52c25d1e297d3da7f1cd2f5d98c47
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role in the representation theory of the symplectic groups as the descent set of a standard tableau plays in the representation theory of the genera
Externí odkaz:
https://doaj.org/article/37e14d0a972347b5a7634cd67c023d8f
Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive lattice L(alph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::661b893a67f7922b18d2cc3bcb35135c
http://arxiv.org/abs/2008.13232
http://arxiv.org/abs/2008.13232
Bipartite projections have become a common way to measure spatial networks. They are now used in many subfields of geography, and are among the most common ways to measure the world city network, where intercity links are inferred from firm co-locati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12d1312baff7b9e035e45ab5b6a91f30
https://doi.org/10.31235/osf.io/u5esd
https://doi.org/10.31235/osf.io/u5esd