Zobrazeno 1 - 10
of 1 747
pro vyhledávání: '"Wagner, Stephan"'
The Colijn--Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank $f(t)$ of a tree $t$ is closely related to its height $h$, the length of the longest path from a leaf to the root
Externí odkaz:
http://arxiv.org/abs/2409.18956
Autor:
Burghart, Fabian, Wagner, Stephan
A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that can arise fr
Externí odkaz:
http://arxiv.org/abs/2406.06359
Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the swapping of ad
Externí odkaz:
http://arxiv.org/abs/2405.20492
Autor:
Schaumann, Sarah K., Kundu, Abhishake, Pina-Pardo, Juan C., Winkenbach, Matthias, Gatica, Ricardo A., Wagner, Stephan M., Matis, Timothy I.
We study the Flying Sidekick Traveling Salesman Problem with Multiple Drops (FSTSP-MD), a multi-modal last-mile delivery model where a single truck and a single drone cooperatively deliver customer packages. In the FSTSP-MD, the drone can be launched
Externí odkaz:
http://arxiv.org/abs/2403.18091
Autor:
Hackl, Benjamin, Wagner, Stephan
Making use of a newly developed package in the computer algebra system SageMath, we show how to perform a full asymptotic analysis by means of the Mellin transform with explicit error bounds. As an application of the method, we answer a question of B
Externí odkaz:
http://arxiv.org/abs/2403.09408
Autor:
Thévenin, Paul, Wagner, Stephan
We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) > \sigma(i+1)$. Likewise
Externí odkaz:
http://arxiv.org/abs/2312.11183
Publikováno v:
The International Journal of Logistics Management, 2024, Vol. 35, Issue 6, pp. 1681-1712.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/IJLM-12-2022-0480
Publikováno v:
LIPIcs, Volume 302, pp. 7:1-7:18, 2024
Composition schemes are ubiquitous in combinatorics, statistical mechanics and probability theory. We give a unifying explanation to various phenomena observed in the combinatorial and statistical physics literature in the context of~$q$-enumeration
Externí odkaz:
http://arxiv.org/abs/2311.17226
Publikováno v:
Electronic Journal of Combinatorics 31(1): P1.62, 2024
For a $k$-tree $T$, we prove that the maximum local mean order is attained in a $k$-clique of degree $1$ and that it is not more than twice the global mean order. We also bound the global mean order if $T$ has no $k$-cliques of degree $2$ and prove t
Externí odkaz:
http://arxiv.org/abs/2309.16545