Related papers: On the Composition of Randomized Query Complexity …
Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical formulation of this problem, where operations on state-based…
We study distributed algorithms for some fundamental problems in data summarization. Given a communication graph $G$ of $n$ nodes each of which may hold a value initially, we focus on computing $\sum_{i=1}^N g(f_i)$, where $f_i$ is the…
A fundamental question in computer science is: Is it harder to solve $n$ instances independently than to solve them simultaneously? This question, known as the direct sum question or direct sum theorem, has been paid much attention in…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
B-terms are built from the B combinator alone defined by B f g x = f (g x), which is well-known as a function composition operator. This paper investigates an interesting property of B-terms, that is, whether repetitive right applications…
Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet…
When spatial constraint for the constituents (e.g., atom or particle) of system is once given, disordered structure for non-interacting system in equilibrium states is symmetric with respect to equiatomic composition. Meanwhile, when the…
A longstanding question in cognitive science concerns the learning mechanisms underlying compositionality in human cognition. Humans can infer the structured relationships (e.g., grammatical rules) implicit in their sensory observations…
The model of relative-error property testing of Boolean functions has been the subject of significant recent research effort [CDH+24][CPPS25a][CPPS25b] In this paper we consider the problem of relative-error testing an unknown and arbitrary…
The (low soundness) linearity testing problem for the middle slice of the Boolean cube is as follows. Let $\varepsilon>0$ and $f$ be a function on the middle slice on the Boolean cube, such that when choosing a uniformly random quadruple…
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…
If a macromolecule is described by curvilinear coordinates or rigid constraints are imposed, the equilibrium probability density that must be sampled in Monte Carlo simulations includes the determinants of different mass-metric tensors. In…
Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…
We show that a strong form (the fully faithful version) of the generating hypothesis, introduced by Freyd in algebraic topology, holds in the derived category of a ring R if and only if R is von Neumann regular. This extends results of the…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Fourier extensions have been shown to be an effective means for the approximation of smooth, nonperiodic functions on bounded intervals given their values on an equispaced, or in general, scattered grid. Related to this method are two…
It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…
The problem of learning structural equation models (SEMs) from data is a fundamental problem in causal inference. We develop a new algorithm --- which is computationally and statistically efficient and works in the high-dimensional regime…
We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…