Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Kaliszewski, Ryan"'
Autor:
Conroy, John M., Molino, Neil P, Baughman, Brian, Gomez, Rod, Kaliszewski, Ryan, Lines, Nicholas A.
In this paper, we explore the role of matrix scaling on a matrix of counts when building a topic model using non-negative matrix factorization. We present a scaling inspired by the normalized Laplacian (NL) for graphs that can greatly improve the qua
Externí odkaz:
http://arxiv.org/abs/2305.05389
Organizations have long used deception as a means to exert influence in pursuit of their agendas. In particular, information operations such as propaganda distribution, support of antigovernment protest, and revelation of politically and socially dam
Externí odkaz:
http://arxiv.org/abs/2011.01331
We combinatorially describe entries of the transition matrices which relate monomial bases of the zero-weight space of the quantum matrix bialgebra. This description leads to a combinatorial rule for evaluating induced sign characters of the type $A$
Externí odkaz:
http://arxiv.org/abs/1802.04856
Autor:
Kaliszewski, Ryan, Morse, Jennifer
The non-negative integer cocharge statistic on words was introduced in the 1970's by Lascoux and Sch\"utzenberger to combinatorially characterize the Hall-Littlewood polynomials. Cocharge has since been used to explain phenomena ranging from the grad
Externí odkaz:
http://arxiv.org/abs/1710.00801
Autor:
Kaliszewski, Ryan, Karmakar, Debdut
Building upon a recent formula for $(3,m)$-Catalan polynomials, we describe a formula for $(3,m)$-Hikita polynomials in terms related to Catalan polynomials. This formula shows a surprising relation among coefficients of Hikita polynomials and implie
Externí odkaz:
http://arxiv.org/abs/1612.04260
We give a direct combinatorial proof of the $q,t$-symmetry relation $\tilde H_{\mu}(X;q,t)=\tilde H_{\mu'}(X;t,q)$ in the Macdonald polynomials $\tilde H_\mu$ at the specialization $q=1$. The bijection demonstrates that the Macdonald inv statistic on
Externí odkaz:
http://arxiv.org/abs/1611.04973
Autor:
Kaliszewski, Ryan, Li, Huilan
For $m,n$ coprime we introduce a new statistic skip on $(m,n)$-rational Dyck paths and give a fast way to compute dinv and skip statistics. We also introduce $(m,n)$-rank words, which are in one-to-one correspondence with $(m,n)$-Dyck paths. Defining
Externí odkaz:
http://arxiv.org/abs/1611.04956
Autor:
Kaliszewski, Ryan, Li, Huilan
We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area,skip,dinv) are given, we have an algorithm to construct the marked r
Externí odkaz:
http://arxiv.org/abs/1412.3475
Autor:
Kaliszewski, Ryan
The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov in 1996.
Externí odkaz:
http://arxiv.org/abs/1404.7531
Autor:
Kaliszewski, Ryan, Morse, Jennifer
Publikováno v:
In European Journal of Combinatorics October 2019 81:354-377
