Related papers: An Improved Composition Theorem of a Universal Rel…
Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with…
We extend a classical result of Caughran/Schwartz and another recent result of Gunatillake by showing that if D is a bounded, convex domain in n-dimensional complex space, m is a holomorphic function on D and bounded away from zero toward…
A central result of Sturm-Liouville theory (also called the Sturm-Hurwitz Theorem) states that if $\phi_k$ is a sequence of eigenfunctions of a second order differential operator on the interval $I \subset \mathbb{R}$, then any linear…
This work presents a detailed mathematical derivation of the hierarchically correlated orbital functional theory (HCOFT), a framework based on hypercomplex orbitals. Recent study [Phys. Rev. Lett. 133, 206402] has demonstrated that…
We answer four questions from a recent paper of Rao and Shinkar on Lipschitz bijections between functions from $\{0,1\}^n$ to $\{0,1\}$. (1) We show that there is no $O(1)$-bi-Lipschitz bijection from $\mathrm{Dictator}$ to $\mathrm{XOR}$…
For certain weighted locally convex spaces $X$ and $Y$ of one real variable smooth functions, we characterize the smooth functions $\varphi: \mathbb{R} \to \mathbb{R}$ for which the composition operator $C_\varphi: X \to Y, \, f \mapsto f…
Designing and implementing systems as an interconnection of smaller subsystems is a common practice for modularity and standardization of components and design algorithms. Although not typically cast in this framework, many of these…
For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…
A key ingredient of the Kochen-Specker theorem is the so-called functional composition principle, which asserts that hidden states must ascribe values to observables in a way that is consistent with all functional relations between them.…
Let $I$ be a homogeneous ideal in the polynomial ring $R = k[z_1, \cdots, z_n]$ , where $k$ is an algebraically closed field of characteristic zero. Macaulay's Theorem provides constraints on the Hilbert function of $I$ or $R/I$ from one…
The fermionic formula conjectured by Kirillov and Reshetikhin describes the decomposition (as a module for $U_q(\frak g)$) of a tensor product of multiples of of fundamental representations $W(m\lambda_i)$ of the corresponding quantum…
We give a new proof that every linear fractional map of the unit ball induces a bounded composition operator on the standard scale of Hilbert function spaces on the ball, and obtain norm bounds analogous to the standard one-variable…
It is shown that a large class of properties coincide for weighted composition operators on a large class of weighted VMOA spaces, including the ones with logarithmic weights and the ones with standard weights $(1-|z|)^{-c}, \ 0\leq c<…
A fruitful approach to study stability of switched systems is to look for multiple Lyapunov functions. However, in general, we do not yet understand the interplay between the desired stability certificate, the template of the Lyapunov…
We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…
Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…
In [3] a short proof is given that some strings have maximal plain Kolmogorov complexity but not maximal prefix-free complexity. The proof uses Levin's symmetry of information, Levin's formula relating plain and prefix complexity and Gacs'…
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…
We suggest a method for holding a dictionary data structure, which maps keys to values, in the spirit of Bloom Filters. The space requirements of the dictionary we suggest are much smaller than those of a hashtable. We allow storing n keys,…
Regular expressions with capture variables, also known as "regex formulas," extract relations of spans (interval positions) from text. These relations can be further manipulated via Relational Algebra as studied in the context of document…