Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Shuhei Tsujie"'
Autor:
Masamichi Kuroda, Shuhei Tsujie
Publikováno v:
Enumerative Combinatorics and Applications, Vol 4, Iss 1, p Article #S2R1 (2023)
Externí odkaz:
https://doaj.org/article/05f7ee4c5c3c430f839ec4f032249c0a
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 27th..., Iss Proceedings (2015)
The Ish arrangement was introduced by Armstrong to give a new interpretation of the $q; t$-Catalan numbers of Garsia and Haiman. Armstrong and Rhoades showed that there are some striking similarities between the Shi arrangement and the Ish arrangemen
Externí odkaz:
https://doaj.org/article/97792207b7fc4ab7a3ec5ae5185e4c88
Autor:
Shuhei Tsujie, Daisuke Suyama
Publikováno v:
Discrete & Computational Geometry. 61:185-197
Let $ G $ be a simple graph of $ \ell $ vertices $ \{1, \dots, \ell \} $ with edge set $ E_{G} $. The graphical arrangement $ \mathcal{A}_{G} $ consists of hyperplanes $ \{x_{i}-x_{j}=0\} $, where $ \{i, j \} \in E_{G} $. It is well known that three
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::891dc75f90c88b327ddf34b739d5d42d
https://doi.org/10.1007/s00454-018-9984-1
https://doi.org/10.1007/s00454-018-9984-1
Autor:
Shuhei Tsujie, Masamichi Kuroda
Publikováno v:
Finite Fields and Their Applications. 47:64-84
Almost perfect nonlinear (APN) functions on finite fields of characteristic two have been studied by many researchers. Such functions have useful properties and applications in cryptography, finite geometries and so on. However, APN functions on fini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb79ef24834a13d43762332a97401fde
https://doi.org/10.1016/j.ffa.2017.05.001
https://doi.org/10.1016/j.ffa.2017.05.001
Autor:
Shuhei Tsujie
In this article, we study freeness of hyperplane arrangements. One of the most investigated arrangement is a graphic arrangement. Stanley proved that a graphic arrangement is free if and only if the corresponding graph is chordal and Dirac showed tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22ab0fa41af38ef498e9bb15777ca9a6
Autor:
Shuhei Tsujie, Michele Torielli
Publikováno v:
Electronic journal of combinatorics. 27(3):P3
Every subarrangement of Weyl arrangements of type $ B_{\ell} $ is represented by a signed graph. Edelman and Reiner characterized freeness of subarrangements between type $ A_{\ell-1} $ and type $ B_{\ell} $ in terms of graphs. Recently, Suyama and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::816440992d428e0868dc71c89145aecb
http://hdl.handle.net/2115/79180
http://hdl.handle.net/2115/79180
Autor:
Masamichi Kuroda, Shuhei Tsujie
Consider finitely many points in a geodesic space. If the distance of two points is less than a fixed threshold, then we regard these two points as "near". Connecting near points with edges, we obtain a simple graph on the points, which is called a u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d40fa7565eb8c48f97a39a6c6f7a6ae2
Autor:
Shuhei Tsujie
Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order quasisymmetric functio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e62dfb99813ea418824d0ba795c50d3
http://arxiv.org/abs/1707.04058
http://arxiv.org/abs/1707.04058
A Weyl arrangement is the hyperplane arrangement defined by a root system. Arnold and Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type $A_{\ell}$ are represented by simple graphs. Stanley gave a characterization of f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcd4bff903825be8f9c3f9605c003dd0
Autor:
Shuhei Tsujie, Takahiro Hasebe
Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric functions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6f1e2891b55b4b954fd082e39be2ca1
http://arxiv.org/abs/1610.03908
http://arxiv.org/abs/1610.03908