English
Related papers

Related papers: Divide-and-conquer generating functions. Part I. E…

200 papers

An exposition on Spivakovsky's dual graphs of valuations on function fields of dimension two is first given, leading to a proof of minimal generating sequences for the non-divisorial valuations. It should be noted that the definition of…

Commutative Algebra · Mathematics 2026-03-31 Charles Li

It is common to view programs as a combination of logic and control: the logic part defines what the program must do, the control part -- how to do it. The Logic Programming paradigm was developed with the intention of separating the logic…

Artificial Intelligence · Computer Science 2011-05-30 O. Ledeniov , S. Markovitch

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Combinatorics · Mathematics 2019-11-13 William J. Keith

We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…

Number Theory · Mathematics 2022-12-14 Marco Streng

We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.

Commutative Algebra · Mathematics 2020-03-27 Ranjana Mehta , Joydip Saha , Indranath Sengupta

We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…

Complex Variables · Mathematics 2019-09-05 Alexander P. Lyapin , Sreelatha Chandragiri

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Pierre Lairez , Bruno Salvy

This paper presents a class of new algorithms for distributed statistical estimation that exploit divide-and-conquer approach. We show that one of the key benefits of the divide-and-conquer strategy is robustness, an important…

Statistics Theory · Mathematics 2018-08-29 Stanislav Minsker , Nate Strawn

Symbolic regression aims to find a function that best explains the relationship between independent variables and the objective value based on a given set of sample data. Genetic programming (GP) is usually considered as an appropriate…

Neural and Evolutionary Computing · Computer Science 2022-09-26 Changtong Luo , Chen Chen , Zonglin Jiang

Some models of clustering processes are formulated and analytically solved employing generating functions methods. Those models include events which result from combined action of the coagulation and fragmentation processes. Fragmentation…

Statistical Mechanics · Physics 2009-11-07 Vladimir M. Dubovik , Arkadi G. Galperin , Viktor S. Richvitsky , Aleksey A. Lushnikov

Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n…

Combinatorics · Mathematics 2009-06-26 Robin Pemantle , Herbert S. Wilf

In this article, we prove that sequences generated by the functional calculus $(f(T)(e_n))_{n \in \mathbb{N}}$ can be equivalently written as function sequences $(f_n(T) g)_{n \in \mathbb{N}}$, when $T$ is normal and $g$ a cyclic vector for…

Functional Analysis · Mathematics 2026-02-11 Nizar El Idrissi

This paper investigates the usage of generating functions (GFs) encoding measures over the program variables for reasoning about discrete probabilistic programs. To that end, we define a denotational GF-transformer semantics for…

Logic in Computer Science · Computer Science 2020-07-14 Lutz Klinkenberg , Kevin Batz , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Joshua Moerman , Tobias Winkler

Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…

Combinatorics · Mathematics 2019-11-07 Kilian Raschel , Amélie Trotignon

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

Combinatorics · Mathematics 2026-02-25 Mahdi Koutchoukali

Numerous novel integral and series representations for Ferrers functions of the first kind (associated Legendre functions on the cut) of arbitrary degree and order, various integral, series and differential relations connecting Ferrers…

Classical Analysis and ODEs · Mathematics 2022-05-04 P. Malits

In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

Logic · Mathematics 2024-08-15 Dag Normann , Sam Sanders

The solution of QCD equations for generating functions of {\it parton} multiplicity distributions reveals new peculiar features of cumulant moments oscillating as functions of their rank. It happens that experimental data on {\it hadron}…

High Energy Physics - Phenomenology · Physics 2007-05-23 I. M. Dremin

We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…

Combinatorics · Mathematics 2018-01-30 Michael H. Albert , Cheyne Homberger , Jay Pantone , Nathaniel Shar , Vincent Vatter