相关论文: Divide-and-conquer generating functions. Part I. E…
Our work shows forms of descent, in the fppf, h and \'{e}tale topologies, for strong generation of the bounded derived category of a noncommutative coherent algebra over a scheme. Even for (commutative) schemes this yields new perspectives.…
The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
For a general family of non-negative functions matching upper and lower bounds are established for their average over the values of any equidistributed sequence.
We exploit a decomposition of graph traversals to give a novel characterization of depth-first and breadth-first traversals as universal constructions. Specifically, we introduce functors from two different categories of edge-ordered…
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…
We describe all Gaussian generating functionals on several easy quantum groups given by non-crossing partitions. This includes in particular the free unitary, orthogonal and symplectic quantum groups. We further characterize central…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
We implement a divide-and-concur iterative projection approach to context-free grammar inference. Unlike most state-of-the-art models of natural language processing, our method requires a relatively small number of discrete parameters,…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
Deep generative models that learn from the distribution of natural protein sequences and structures may enable the design of new proteins with valuable functions. While the majority of today's models focus on generating either sequences or…
The generating function and an explicit expression is derived for the (colored) Motzkin numbers of higher rank introduced recently. Considering the special case of rank one yields the corresponding results for the conventional colored…
There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…
We will derive a function that eliminates any sequence of equidistant numbers from the integer numbers, then we will derive its inverse. Then we will use the Sequence elimination function to eliminate the multiples of the prime numbers from…
One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.
Partially ordered sets have received much attention in recent years, not just due to their usefulness in combinatorics and abstract algebra, but also due to their practical applications in fields ranging from chemistry to macroeconomics.…
We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…
We compute generators and relations for the section ring of a rational divisor on an elliptic curve. Our technique generalizes the work of O'Dorney (in genus zero) and Voight--Zureick-Brown (for specific divisors arising from the study of…