Related papers: LSM is not generated by binary functions

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

For any real $t$, the unitary divisor function $\sigma_t^*$ is the multiplicative arithmetic function defined by $\sigma_t^*(p^{\alpha})=1+p^{\alpha t}$ for all primes $p$ and positive integers $\alpha$. Let $\overline{\sigma_t^*(\mathbb…

$\{log\}$ is a programming language at the intersection of Constraint Logic Programming, set programming and declarative programming. But $\{log\}$ is also a satisfiability solver for a theory of finite sets and finite binary relations.…

A pseudomodular group is a discrete subgroup $\Gamma \leq PGL(2,\mathbb{Q})$ which is not commensurable with $PSL(2,\mathbb{Z})$ and has cusp set precisely $\mathbb{Q}\cup\{\infty\}$. The existence of such groups was proved by Long and…

A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…

Several interesting generative learning algorithms involve a complex probability distribution over many random variables, involving intractable normalization constants or latent variable normalization. Some of them may even not have an…

Associated to each simplicial complex is a binary hierarchical model. We classify the simplicial complexes that yield unimodular binary hierarchical models. Our main theorem provides both a construction of all unimodular binary hierarchical…

Let $A$ be an infinite set. Let $\Omega(A)$ be the algebra over $A$ where every constant is a fundamental constant and every finitary function is a fundamental operation. We shall give a method of representing any algebra $\mathcal{L}$ in…

In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions $f$ there is a branching program computing a doubly exponential number of copies of $f$ which has linear size…

The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…

Diestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call this structural submodularity. Williamson, Goemans, Mihail,…

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…

We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying this technique, we prove that any deterministic SFM algorithm on a ground set of…

Let $X$ and $Y$ be Banach spaces and $(\Omega,\Sigma,\mu)$ a finite measure space. In this note we introduce the space $L^p[\mu;L(X,Y)]$ consisting of all (equivalence classes of) functions $\Phi:\Omega \mapsto L(X,Y)$ such that $\omega…

Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…

A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…

In the present paper derivations and *-automorphisms of algebras of unbounded operators over the ring of measurable functions are investigated and it is shown that all L^0-linear derivations and L^{0}-linear *-automorphisms are inner.…

In the high spin limit the minimal anomalous dimension of (fixed) twist operators in the $sl(2)$ sector of planar ${\cal N}=4$ Super Yang-Mills theory expands as $\gamma(g,s,L)=f(g) \ln s + f_{sl}(g,L) + \sum \limits_{n=1}^\infty…