Zobrazeno 1 - 10
of 289
pro vyhledávání: '"Kauers Manuel"'
Symmetries have been exploited successfully within the realms of SAT and QBF to improve solver performance in practical applications and to devise more powerful proof systems. As a first step towards extending these advancements to the class of depen
Externí odkaz:
http://arxiv.org/abs/2410.15848
One of the most important sequences in enumerative combinatorics is OEIS sequence A85, the number of involutions of length n. In the Art of Computer Programming, vol. 3, Don Knuth derived the O(1/n) asymptotic formula for these numbers. In this modes
Externí odkaz:
http://arxiv.org/abs/2410.16334
Autor:
Šeliga Adam, Kauers Manuel, Saminger-Platz Susanne, Mesiar Radko, Kolesárová Anna, Klement Erich Peter
Publikováno v:
Dependence Modeling, Vol 9, Iss 1, Pp 13-42 (2021)
Bivariate polynomial copulas of degree 5 (containing the family of Eyraud-Farlie-Gumbel-Morgenstern copulas) are in a one-to-one correspondence to certain real parameter triplets (a, b, c), i.e., to some set of polynomials in two variables of degree
Externí odkaz:
https://doaj.org/article/25fdaa58c61d4d5fa4c43ece7c732d34
Autor:
Buchacher, Manfred, Kauers, Manuel
For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with n+m variables, we want to find all elements that can be written as f-g for some f in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that contain no term
Externí odkaz:
http://arxiv.org/abs/2405.19223
We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive sequence and
Externí odkaz:
http://arxiv.org/abs/2402.04684
We propose a way to split a given bivariate P-recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction-based creative telescopi
Externí odkaz:
http://arxiv.org/abs/2311.05246
In 2014, R.H. Hardin contributed a family of sequences about king-moves on an array to the On-Line Encyclopedia of Integer Sequences (OEIS). The sequences were recently noticed in an automated search of the OEIS by Kauers and Koutschan, who conjectur
Externí odkaz:
http://arxiv.org/abs/2309.00487
Autor:
Kauers, Manuel, Moosbauer, Jakob
For various $2\leq n,m \leq 6$, we propose some new algorithms for multiplying an $n\times m$ matrix with an $m \times 6$ matrix over a possibly noncommutative coefficient ring.
Comment: 9 pages
Comment: 9 pages
Externí odkaz:
http://arxiv.org/abs/2306.00882
Autor:
Kauers, Manuel, Koutschan, Christoph
Publikováno v:
Journal of Integer Sequences, vol. 26, article 23.4.5, 2023
In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to prove the
Externí odkaz:
http://arxiv.org/abs/2303.02793
Publikováno v:
Proceedings of International Symposium on Symbolic and Algebraic Computation 2023
Although in theory we can decide whether a given D-finite function is transcendental, transcendence proofs remain a challenge in practice. Typically, transcendence is certified by checking certain incomplete sufficient conditions. In this paper we pr
Externí odkaz:
http://arxiv.org/abs/2302.06396