Related papers: LSM is not generated by binary functions
We investigate the existence of bounded-memory consistent estimators of various statistical functionals. This question is resolved in the negative in a rather strong sense. We propose various bounded-memory approximations, using techniques…
Following the work done by Olshanskii for groups, we describe, for a given semigroup $S$, which functions $l : S \rightarrow \mathbb{N}$ can be realized up to equivalence as length functions $g \mapsto |g|_{H}$ by embedding $S$ into a…
The notion of ordinal concavity of utility functions has recently been considered by Hafalir, Kojima, Yenmez, and Yokote in economics while there exist earlier related works in discrete optimization and operations research. In the present…
One-loop functions with loop masses larger than external masses and momenta can always be expanded in terms of external masses and momenta. The precision requested for observables determines the number of the expansion terms retained in the…
Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lov\'asz extension. The polar…
We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of {\em exchange capacities}. This holds, for example, for terms depending on a small number of…
Separable nonlinear least squares (SNLS)problem is a special class of nonlinear least squares (NLS)problems, whose objective function is a mixture of linear and nonlinear functions. It has many applications in many different areas,…
The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…
A Lagrange multiplier theorem is derived for the case of an imprecise objective function and a precise constraint. The proof uses methods of analysis which deal in a direct, algebraic way with imprecisions. They include imprecise…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
The connection between multiple modular L-functions, as defined by Manin in [5], and modular iterated integrals was made explicit by Choie and Ihara [3] under the restrictive assumption that all modular forms involved have vanishing…
We describe an algorithm for computing the inner product between a holomorphic modular form and a unary theta function, in order to determine whether the form is orthogonal to unary theta functions without needing a basis of the entire…
We present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations. As applications, we present explicit…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
Binary code analysis is the foundation of crucial tasks in the security domain; thus building effective binary analysis techniques is more important than ever. Large language models (LLMs) although have brought impressive improvement to…
The LULU operators, well known in the nonlinear multiresolution analysis of sequences, are extended to functions defined on continuous domain, namely, a real interval $\Omega\subseteq\mathbb{R}$. Similar to their discrete counterparts, for…
We examine convergent representations for the sum of Bessel functions \[\sum_{n=1}^\infty \frac{J_\mu(na) J_\nu(nb)}{n^{\alpha}}\] for $\mu$, $\nu\geq0$ and positive values of $a$ and $b$. Such representations enable easy computation of the…
Let $s\in(0,1),$ $1<p<\frac{N}{s}$ and $\Omega\subset\mathbb{R}^N$ be an open bounded set. In this work we study the existence of solutions to problems ($E_\pm$) $Lu\pm g(u)=\mu$ and $u=0$ a.e. in $\mathbb{R}^N\setminus\Omega,$ where $g\in…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…