Results 11 to 20 of about 2,755,381 (193)
The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We prove the existence of an invariant ring \textbfC[X_1,...,X_n]^T generated by elements with a total degree of at most 2, which has no finite SAGBI basis with respect to any admissible order. Therefore, 2 is the optimal lower bound for the total degree
Manfred Göbel
doaj +1 more source
Series acceleration formulas obtained from experimentally discovered hypergeometric recursions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 In 2010, Kh. Hessami Pilehrood and T. Hessami Pilehrood introduced generating function identities used to obtain series accelerations for values of Dirichlet's $\beta$ function, via the Markov--Wilf--Zeilberger method.
Paul Levrie, John Campbell
doaj +1 more source
Convergence of some leader election algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We start with a set of $n$ players. With some probability $P(n,k)$, we kill $n-k$ players; the other ones stay alive, and we repeat with them. What is the distribution of the number $X_n$ of \emph{phases} (or rounds) before getting only one player?
Svante Janson +2 more
doaj +1 more source
A note on limits of sequences of binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the ...
Rudolf Grübel
doaj +1 more source
Anti-power $j$-fixes of the Thue-Morse word [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Recently, Fici, Restivo, Silva, and Zamboni introduced the notion of a $k$-anti-power, which is defined as a word of the form $w^{(1)} w^{(2)} \cdots w^{(k)}$, where $w^{(1)}, w^{(2)}, \ldots, w^{(k)}$ are distinct words of the same length.
Marisa Gaetz
doaj +1 more source
Approximation result toward nearest neighbor heuristic [PDF]
Yugoslav Journal of Operations Research, 2002 In this paper, we revisit the famous heuristic called nearest neighbor (N N) for the traveling salesman problem under maximization and minimization goal.
Monnot Jér"me
doaj +1 more source
On non-adaptive majority problems of large query size [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We are given $n$ balls and an unknown coloring of them with two colors. Our goal is to find a ball that belongs to the larger color class, or show that the color classes have the same size.
Dániel Gerbner, Máté Vizer
doaj +1 more source
Quicksort algorithm again revisited [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We consider the standard Quicksort algorithm that sorts n distinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length L(n) in a randomly built \emphbinary search tree.
Charles Knessl, Wojciech Szpankowski
doaj +1 more source
An LTL proof system for runtime verification [PDF]
, 2015 We propose a local proof system for LTL formalising deductions within the constraints of Runtime Verification (RV), and show how such a system can be used as a basis for the construction of online runtime monitors.
21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems +2 more
core +1 more source
How often should you clean your room? [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Analysis of ...
Kimball Martin, Krishnan Shankar
doaj +1 more source