Zobrazeno 1 - 10
of 17 444
pro vyhledávání: '"unimodality"'
Autor:
Beaton, Iain, Schoonhoven, Sam
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In \cite{IntroDomPoly
Externí odkaz:
http://arxiv.org/abs/2411.02288
Autor:
Zhou, Nian Hong
In this paper, we examine the unimodality and strict unimodality of certain formal bivariate Laurent series with non-negative coefficients. We show that the sets of these formal bivariate Laurent series form commutative semirings under the operations
Externí odkaz:
http://arxiv.org/abs/2408.04433
Elementary, but very useful lemma due to Biernacki and Krzy\.{z} (1955) asserts that the ratio of two power series inherits monotonicity from that of the sequence of ratios of their corresponding coefficients. Over the last two decades it has been re
Externí odkaz:
http://arxiv.org/abs/2408.01755
Autor:
Brenti, Francesco
Publikováno v:
in "Open Problems in Algebraic Combinatorics", (C. Berkesch, B. Brubaker, G. Musiker, P. Pylyavskyy, and V. Reiner, editors) Proceedings of Symposia in Pure Math., American Mathematical Society, Vol. 110 (2024), 23-37
In this paper I present some open problems on Coxeter groups and unimodality, together with the main partial results, and computational evidence, that are known about them.
Comment: 14 pages
Comment: 14 pages
Externí odkaz:
http://arxiv.org/abs/2410.09897
Autor:
Zang, Wenston J. T.
Let $\{a_i\}_{i=1}^\ell$ be a strongly unimodal positive integer sequence with peak position $k$. The rank of such sequence is defined to be $\ell-2k+1$. Let $u(m,n)$ denote the number of sequences $\{a_i\}_{i=1}^\ell$ with rank $m$ and $\sum_{i=1}^{
Externí odkaz:
http://arxiv.org/abs/2407.18186
Unimodality of the normalized coefficients of the characteristic polynomial of distance matrices of trees are known and bounds on the location of its peak (the largest coefficient) are also known. Recently, an extension of these results to distance m
Externí odkaz:
http://arxiv.org/abs/2407.03309
In this paper, we introduce the concept of the over-Mahonian number, which counts the overlined permutations of length $n$ with $k$ inversions, allowing the first elements associated with the inversions to be independently overlined or not. We explor
Externí odkaz:
http://arxiv.org/abs/2406.10487
Autor:
Leonardos, Stefanos1 (AUTHOR) stefanos.leonardos@kcl.ac.uk, Koki, Constandina2 (AUTHOR), Melolidakis, Costis3 (AUTHOR)
Publikováno v:
Annals of Operations Research. May2024, Vol. 336 Issue 3, p1661-1679. 19p.