Related papers: New Constructions of Sonar Sequences
This work deals with the presence of defect structures in generalized sine-Gordon models. The models are described by periodic potentials, with substructure having one, two, three or more distinct topological sectors, with multiplicity one,…
This paper discusses the question of how to recognize whether an operad is E_n (ie. equivalent to the little n-cubes operad). A construction is given which produces many new examples of E_n operads. This construction is developed in the…
We revisit the old idea of constructing difference sets from cyclotomic classes. Two constructions of skew Hadamard difference sets are given in the additive groups of finite fields using unions of cyclotomic classes of order $N=2p_1^m$,…
In this paper, we develop a structure theory for generalized spectral sequences, which are derived from chain complexes that are filtered over arbitrary partially ordered sets. Also, a more general construction method reminiscent of exact…
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…
The structure of the hadron resonances attracts much attention, in association with the recent observations of various exotic hadrons which do not fit well in the conventional picture. These findings urge us to consider various new…
Construction sequences are a general method of building symbolic shifts that capture cut-and-stack constructions and are general enough to give symbolic representations of Anosov-Katok diffeomorphisms. We show here that any finite entropy…
A chord diagram consists of a circle, called the backbone, with line segments, called chords, whose endpoints are attached to distinct points on the circle. The genus of a chord diagram is the genus of the orientable surface obtained by…
A set $S\subset \mathbb{N}$ is a Sidon set if all pairwise sums $s_1+s_2$ (for $s_1, s_2\in S$, $s_1\leq s_2$) are distinct. A set $S\subset \mathbb{N}$ is an asymptotic basis of order 3 if every sufficiently large integer $n$ can be…
A new approach to composite superconformal strings is considered . This composite string model has two scales: first one (~1 Gev) is for edging surfaces and second one (Planck scale) is for ridge surfaces . Nonlinear realization of…
Chords in musical harmony can be viewed as objects having shapes (major/minor/etc.) attached to base sets (pitch class sets). The base set and the shape set are usually given the structure of a group, more particularly a cyclic group. In a…
Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…
The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
We explore the space of matrix-generated (0, m, 2)-nets and (0, 2)-sequences in base 2, also known as digital dyadic nets and sequences. In computer graphics, they are arguably leading the competition for use in rendering. We provide a…
In the short note, we describe a sampling construction that yields a sequence of graphons converging to a prescribed limit graphon in 1-norm. This convergence is stronger than the convergence in the cut norm, usually used to study graphon…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…