Related papers: LSM is not generated by binary functions
A uniformization of a binary relation is a function that is contained in the relation and has the same domain as the relation. The synthesis problem asks for effective uniformization for classes of relations and functions that can be…
We give an alternative proof of a fact that a finite continuous non-decreasing submodular set function on a measurable space can be expressed as a supremum of measures dominated by the function, if there exists a class of sets which is…
The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…
Submodular function maximization has found a wealth of new applications in machine learning models during the past years. The related supermodular maximization models (submodular minimization) also offer an abundance of applications, but…
LLMs can be unpredictable, as even slight alterations to the prompt can cause the output to change in unexpected ways. Thus, the ability of models to accurately explain their behavior is critical, especially in high-stakes settings. One…
Determining the matrix multiplication exponent $\omega$ is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove $\omega = 2$ by starting with structure tensors of modules of fixed degree…
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…
Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
Let $G$ be a locally compact abelian metric group with Haar measure $\lambda $ and $\hat{G}$ its dual with Haar measure $\mu ,$ and $\lambda ( G) $ is finite. Assume that$~1<p_{i}<\infty $, $p_{i}^{\prime }=\frac{ p_{i}}{p_{i}-1}$, $(…
The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications.…
Boja\'nczyk recently initiated an intensive study of deterministic pebble transducers, which are two-way automata that can drop marks (named "pebbles") on their input word, and produce an output word. They describe functions from words to…
A method for determining the generalised scaling function(s) arising in the high spin behaviour of long operator anomalous dimensions in the planar $sl(2)$ sector of ${\cal N}=4$ SYM is proposed. The all-order perturbative expansion around…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
We present in a unified setting the foundations for a theory of non-bilinear Dirichlet functionals on Hilbert spaces. We prove known and new equivalences between non-linear semigroups, non-linear resolvents, non-linear generators, and their…
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one…
Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
Recently, new classes of positive and measurable functions, $\mathcal{M}(\rho)$ and $\mathcal{M}(\pm \infty)$, have been defined in terms of their asymptotic behaviour at infinity, when normalized by a logarithm (Cadena et al., 2015, 2016,…