Related papers: Formal series and numerical integrators: some hist…
In the classical sense, the set B consists of all integers which can be written as a sum of two perfect squares. In other words, these are the values attained by norms of integral ideals over the Gaussian field Q(i). G.J. Rieger (1965) and…
Mixed-integer programming (MIP) provides a powerful framework for optimization problems, with Branch-and-Cut (B&C) being the predominant algorithm in state-of-the-art solvers. The efficiency of B&C critically depends on heuristic policies…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
Parameterized strings are a generalization of strings in that their characters are drawn from two different alphabets, where one is considered to be the alphabet of static characters and the other to be the alphabet of parameter characters.…
Information, stored or transmitted in digital form, is often structured. Individual data records are usually represented as hierarchies of their elements. Together, records form larger structures. Information processing applications have to…
In this paper, we prove results on enumerations of sets of Rota-Baxter words in a finite number of generators and a finite number of unary operators. Rota-Baxter words are words formed by concatenating generators and images of words under…
Umbral theory, formulated in its modern version by S. Roman and G.~C. Rota, has been reconsidered in more recent times by G. Dattoli and collaborators with the aim of devising a working computational tool in the framework of special…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
Many mathematical objects can be represented as functors from finitely-presented categories $\mathsf{C}$ to $\mathsf{Set}$. For instance, graphs are functors to $\mathsf{Set}$ from the category with two parallel arrows. Such functors are…
Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential…
For a real reductive linear Lie group G, the space of Whittaker functions is the representation space induced from a non-degenerate unitary character of the Iwasawa nilpotent subgroup. Defined are the standard Whittaker (g,K)-modules, which…
The main objective of this series of papers is to explore the entire landscape of numerical methods for fast nonlinear Fourier transformation (NFT) within the class of integrators known as the exponential integrators. In this paper, we…
The A-hypergeometric system studied by I.M. Gelfand, M.I. Graev, A.V. Zelevinsky and the author, is defined for a set A of characters of an algebraic torus. In this paper we propose a generalization of the theory where the torus is replaced…
Exponential integrators are explicit methods for solving ordinary differential equations that treat linear behaviour exactly. The stiff-order conditions for exponential integrators derived in a Banach space framework by Hochbruck and…
Positional numeration systems are a large family of numeration systems used to represent natural numbers. Whether the set of all representations forms a regular language or not is one of the most important questions that can be asked of…
Toric ideals to hierarchical models are invariant under the action of a product of symmetric groups. Taking the number of factors, say m, into account, we introduce and study invariant filtrations and their equivariant Hilbert series. We…
Symmetry is a key property of numerical methods. The geometric properties of symmetric schemes make them an attractive option for integrating Hamiltonian systems, whilst their ability to exactly recover the initial condition without the…
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…
Algebraic power series are formal power series which satisfy a univariate polynomial equation over the polynomial ring in n variables. This relation determines the series only up to conjugacy. Via the Artin-Mazur theorem and the implicit…
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…