Related papers: The Target Discounted-Sum Problem
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Buchi, Co-Buchi, and parity…
We investigate pseudo-polynomial time algorithms for Subset Sum. Given a multi-set $X$ of $n$ positive integers and a target $t$, Subset Sum asks whether some subset of $X$ sums to $t$. Bringmann proposes an $\tilde{O}(n + t)$-time…
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems,…
In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a sum, product and quotient of some series of positive rational…
Given a set of $n$ real numbers, the 3SUM problem is to decide whether there are three of them that sum to zero. Until a recent breakthrough by Gr{\o}nlund and Pettie [FOCS'14], a simple $\Theta(n^2)$-time deterministic algorithm for this…
The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…
We prove a new linear relation for multiple zeta values. This is a natural generalization of the restricted sum formula proved by Eie, Liaw and Ong. We also present an analogous result for finite multiple zeta values.
In contextual dynamic pricing, a seller sequentially prices goods based on contextual information. Buyers will purchase products only if the prices are below their valuations. The goal of the seller is to design a pricing strategy that…
The Wang-Landau algorithm aims at sampling from a probability distribution, while penalizing some regions of the state space and favoring others. It is widely used, but its convergence properties are still unknown. We show that for some…
For two-person dynamic zero-sum games (both discrete and continuous settings), we investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity and the limit of value…
Evidential reasoning is now a leading topic in Artificial Intelligence. Evidence is represented by a variety of evidential functions. Evidential reasoning is carried out by certain kinds of fundamental operation on these functions. This…
Discrete sums of exponentials $g(w) = \sum a_{\beta} \mathrm{e}^{\beta w}$ with positive exponents may converge not normally in neighborhoods $H$ of $-\infty$ which do not contain half-planes. We study different notions of convergence for…
The lambda calculus since more than half a century is a model and foundation of functional programming languages. However, lambda expressions can be evaluated with different reduction strategies and thus, there is no fixed cost model nor…
We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…
Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…
A finite constraint language $\mathscr{R}$ is a finite set of relations over some finite domain $A$. We show that intractability of the constraint satisfaction problem $\operatorname{CSP}(\mathscr{R})$ can, in all known cases, be replaced…
We study the optimization of functions with $n>2$ arguments that have a representation as a sum of several functions that have only $2$ of the $n$ arguments each, termed sums of bivariates, on finite domains. The complexity of optimizing…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…
We consider the problem of finding the minimizer of a function $f: \mathbb{R}^d \rightarrow \mathbb{R}$ of the finite-sum form $\min f(w) = 1/n\sum_{i}^n f_i(w)$. This problem has been studied intensively in recent years in the field of…