Related papers: A complementary construction using mutually unbias…
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
We construct a quadratic basis of generators of matrix-extended $\mathcal{W}_{1+\infty}$ using a generalization of the Miura transformation. This makes it possible to conjecture a closed-form formula for the operator product expansions…
In this paper, we construct the Bessel line ensemble, a countable collection of continuous random curves. This line ensemble is stationary under horizontal shifts with the Bessel point process as its one-time marginal. Its finite…
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise…
Integrable couplings are associated with non-semisimple Lie algebras. In this paper, we propose a new method to generate new integrable systems through making perturbation in matrix spectral problems for integrable couplings, which is…
We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…
We investigate synthesis of a large effective aperture using a sparse array of subarrays. We employ a multi-objective optimization framework for placement of subarrays within a prescribed area dictated by form factor constraints, trading…
We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…
We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive…
A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…
For a fixed $c > 0$ we construct an arbitrarily large set $B$ of size $n$ such that its sum set $B+B$ contains a convex sequence of size $cn^2$, answering a question of Hegarty.
We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…
In this work, we present a new approach for constructing models for correlation matrices with a user-defined graphical structure. The graphical structure makes correlation matrices interpretable and avoids the quadratic increase of…
A series of recent papers has used a parsing algorithm due to Shen et al. (2018) to recover phrase-structure trees based on proxies for "syntactic depth." These proxy depths are obtained from the representations learned by recurrent…
We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…
We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…
We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our…
We describe a self-contained procedure for constructing the traceless projection of mixed tensor products (built out of a finite-dimensional complex vector space and its dual). The construction relies on the Schur-Weyl duality for the…
In this work, the concept of mutually unbiased frames is introduced as the most general notion of unbiasedness for sets composed by linearly independent and normalized vectors. It encompasses the already existing notions of unbiasedness for…
Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…