Related papers: Constructing orientable and negative orientable se…
This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms…
If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an…
We consider reversible vector fields in $\mathbb{R}^{2n}$ such that the set of fixed points of the involutory reversing symmetry is $n$-dimensional. Let such system have a smooth one-parameter family of symmetric periodic orbits which is of…
Optimization with nonnegative orthogonality constraints has wide applications in machine learning and data sciences. It is NP-hard due to some combinatorial properties of the constraints. We first propose an equivalent optimization…
We describe a data structure that supports access, rank and select queries, as well as symbol insertions and deletions, on a string $S[1,n]$ over alphabet $[1..\sigma]$ in time $O(\lg n/\lg\lg n)$, which is optimal even on binary sequences…
We introduce a novel technique to find the asymptotic time behaviour of deterministic systems exhibiting anomalous diffusion. The procedure is tested for various classes of simple but physically relevant 1-D maps and possible relevance of…
For the Riesz and logarithmic energies, we consider a greedy sequence $(a_n)_{n=0}^\infty$ of points on the unit circle $S^1$ constructed in such a way that for every integer $N\geq 2$, the energy of the configuration…
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…
Oscillators are ubiquitous in nature, and usually associated with the existence of an asymptotic phase that governs the long-term dynamics of the oscillator. % We show that asymptotic phase can be estimated using a carefully chosen series…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
A long-standing question in two dimensional Anisotropic Kepler Problem (AKP) concerns with the uniqueness of an unstable periodic orbit (PO) for a given binary code (modulo symmetry equivalence). In this paper, a finite level ($N$) surface…
A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated…
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…
For any quantity of interest in a system governed by ordinary differential equations, it is natural to seek the largest (or smallest) long-time average among solution trajectories, as well as the extremal trajectories themselves. Upper…
If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…
We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…
We consider sequences $(B_k)_{k=0}^\infty$ of points obtained by projecting back and forth between two manifolds $\M_1$ and $\M_2$, and give conditions guaranteeing that the sequence converge to a limit $B_\infty\in\M_1\cap\M_2$. Our…
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…
A novel type of trajectory on semiflows, called asymptotically unpredictable, was proposed by Fen and Tokmak Fen [15]. The presence of sensitivity, which is an indispensable feature of chaotic dynamics, is a crucial property that arises…