Zobrazeno 1 - 10
of 322
pro vyhledávání: '"05A15, 05A16"'
Autor:
Shiff, Chloe E., Rosenberg, Noah A.
Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable lineages asso
Externí odkaz:
http://arxiv.org/abs/2410.14915
We give a short proof of a recent result of Claesson, Dukes, Frankl\'in and Stef\'ansson, that connects tournament score sequences and the Erd\H{o}s-Ginzburg-Ziv numbers from additive number theory. We show that this connection is, in fact, an instan
Externí odkaz:
http://arxiv.org/abs/2407.01441
In 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum to the sum
Externí odkaz:
http://arxiv.org/abs/2406.06036
Consider a search from the root of an ordered tree with $n$ edges to some target node at a fixed distance $\ell$ from that root. We compare the average time complexity of the breadth-first search (BFS) and depth-first search (DFS) algorithms, when th
Externí odkaz:
http://arxiv.org/abs/2404.05664
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:
Aíza, Ricardo Gómez
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of "petals" in
Externí odkaz:
http://arxiv.org/abs/2402.16111
The Riviera model is a combinatorial model for a settlement along a coastline, introduced recently by the authors. Of most interest are the so-called jammed states, where no more houses can be built without violating the condition that every house ne
Externí odkaz:
http://arxiv.org/abs/2401.01225
In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues until the syst
Externí odkaz:
http://arxiv.org/abs/2312.02747
A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x
Externí odkaz:
http://arxiv.org/abs/2311.08023
Autor:
Lenoir, Théo
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a consequence, we obt
Externí odkaz:
http://arxiv.org/abs/2310.01318