Related papers: Constructing orientable and negative orientable se…
Iterated asymptotic cones have been used by Dru\c{t}u and Sapir to construct a group with uncountably many pairwise non-homeomorphic asymptotic cones. In this paper we define a class of metric spaces which display a wide range of behaviors…
Binary sequences with minimal autocorrelations have applications in communication engineering, mathematics and computer science. In statistical physics they appear as groundstates of the Bernasconi model. Finding these sequences is a…
A $(1+\epsilon)$-approximate distance oracle of an edge-weighted graph is a data structure that returns an approximate shortest path distance between any two query vertices up to a $(1+\epsilon)$ factor. Thorup (FOCS 2001, JACM 2004) and…
We experimentaly investigate higher-order seeded modulation instability in an optical fiber experiment. The recirculating loop configuration with round-trip losses compensation enables the observation in single-shot of the spatio-temporal…
Planet formation is often considered in the context of one circumstellar disk around one star. Yet stellar binary systems are ubiquitous, and thus a substantial fraction of all potential planets must form and evolve in more complex,…
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of…
Let T d (n) be the set of d-ary rooted trees with n internal nodes. We give a method to construct a sequence (t n , n $\ge$ 0) where, for any n $\ge$ 1, t n has the uniform distribution in T d (n), and t n is constructed from t n--1 by the…
We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…
In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups of finite fields to construct FHS sets, while other papers…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
When facing time-variant problems in analog computing, the desirable RNN design requires finite-time convergence and robustness with respect to various types of uncertainties, due to the time-variant nature and difficulties in…
New generalized cyclotomic binary sequences of period $p^2$ are proposed in this paper, where $p$ is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
A simple linear search algorithm running in $O(n+mk)$ time is proposed for constructing the lower envelope of $k$ vertices from $m$ monotone polygonal chains in 2D with $n$ vertices in total. This can be applied to output-sensitive…
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…
Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree…
Cellular checkerboard patterns are observed at many developmental stages of embryos. We study an analytically tractable model for lateral inhibition and show that a coupling coefficient with a negative value is sufficient to obtain noisy or…
We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$…
We introduce the notion of exact tilting objects, which are partial tilting objects $T$ inducing an equivalence between the abelian category generated by $T$ and the category of modules over the endomorphism algebra of $T$. Given a chain of…
We briefly discuss a method to construct a global, analytic, approximate spacetime for precessing, spinning binary black holes. The spacetime construction is broken into three parts: the inner zones are the spacetimes close to each black…