Zobrazeno 1 - 10
of 2 247
pro vyhledávání: '"Sagan P"'
Autor:
Sagan, Bruce E., Wilson, Alexander N.
Let u be a word over the positive integers. Motivated in part by a question from representation theory, we study the centralizer set of u which is C(u) = {w | uw is Knuth-equivalent to wu}. In particular, we give various necessary conditions for w to
Externí odkaz:
http://arxiv.org/abs/2410.20460
Autor:
Sagan, Naomi, Weissman, Tsachy
We propose and study a family of universal sequential probability assignments on individual sequences, based on the incremental parsing procedure of the Lempel-Ziv (LZ78) compression algorithm. We show that the normalized log loss under any of these
Externí odkaz:
http://arxiv.org/abs/2410.06589
We report on measurements and modeling studies performed from 2021 to 2024 on the 76 sextupole magnets in the Cornell Electron-positron Storage Ring CESR. Beam-based, magnet-specific calibrations ($K_2$ value versus excitation current) were measured.
Externí odkaz:
http://arxiv.org/abs/2409.19728
Let e_k(x_1,...,x_l) be an elementary symmetric polynomial and let mu = (mu_1,...,mu_l) be an integer partition. Define pre_k(mu) to be the partition whose parts are the summands in the evaluation e_k(mu_1,...,mu_l). The study of such partitions was
Externí odkaz:
http://arxiv.org/abs/2409.11268
Autor:
Sagan, Bruce E, Swanson, Joshua
In an earlier paper, we defined and studied q-analogues of the Stirling numbers of both types for the Coxeter group of type B. In the present work, we show how this approach can be extended to all irreducible complex reflection groups G. The Stirling
Externí odkaz:
http://arxiv.org/abs/2408.13874
Ascent sequences play a key role in the combinatorics of Fishburn structures. Difference ascent sequences are a natural generalization obtained by replacing ascents with $d$-ascents. We have recently extended the so-called hat map to difference ascen
Externí odkaz:
http://arxiv.org/abs/2408.06959
Autor:
Liang, Jinting, Sagan, Bruce E.
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal Lemma to prov
Externí odkaz:
http://arxiv.org/abs/2408.02782
Autor:
Sagan, Bruce E., Tom, Foster
We prove necessary conditions for certain elementary symmetric functions, $e_\lambda$, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the generalization considered by Shareshian and Wachs. We do this by fir
Externí odkaz:
http://arxiv.org/abs/2407.06155
We introduce the concept of rings of simple range 2. Based on this concept, we build a theory diagonal reduction of matrices over Bezout domain. In particular we show that invariant Bezout domain is an elementary divisor ring if and only if it is a r
Externí odkaz:
http://arxiv.org/abs/2407.03196
Ascent sequences and their modified version play a central role in the bijective framework relating several combinatorial structures counted by the Fishburn numbers. Ascent sequences are nonnegative integer sequences defined by imposing a bound on th
Externí odkaz:
http://arxiv.org/abs/2406.12610