Related papers: New Constructions of Sonar Sequences
This paper studies visual search using structured queries. The structure is in the form of a 2D composition that encodes the position and the category of the objects. The transformation of the position and the category of the objects leads…
We construct two knot invariants. The first knot invariant is a sum constructed using linking numbers. The second is an invariant of flat knots and is a formal sum of flat knots obtained by smoothing pairs of crossings. This invariant can…
We present a systematic construction of finite element exact sequences with a commuting diagram for the de Rham complex in one-, two- and three-space dimensions. We apply the construction in two-space dimensions to rediscover two families…
A palindromic composition of $n$ is a composition of $n$ which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of $n$ to be a composition of $n$ which has no mirror symmetry amongst…
The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…
Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low complexities. We present a new method of constructing CDMA sequence sets with the complexity of the Legendre from new frequency hop…
We describe a new realization of supersymmetry, called scalar supersymmetry, acting in spaces of differential forms (bi-spinors), where transformation parameters are Lorentz scalars instead of spinors. The realization is related but is not…
Double cosets appear in many contexts in combinatorics, for example in the enumeration of certain objects up to symmetries. Double cosets in a quotient of the form $H\backslash G / H$ have an inverse, and can be their own inverse. In this…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
We use non-perturbative U-duality symmetries of type II strings to construct new vacuum solutions. In some ways this generalizes the F-theory vacuum constructions. We find the possibilities of new vacuum constructions are very limited.…
We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and…
We enumerate chord diagrams without loops and without both loops and parallel chords. We show that the former ones describe Hamiltonian paths in $n$-dimensional octahedrons. The latter ones are also known as shapes. For labelled diagrams we…
In array-based DNA synthesis, multiple strands of DNA are synthesized in parallel to reduce the time cost from the sum of their lengths to the length their shortest common supersequences. To maximize the amount of information that can be…
We give a description of unital operads in a symmetric monoidal category as monoids in a monoidal category of unital $\Lambda$-sequences. This is a new variant of Kelly's old description of operads as monoids in the monoidal category of…
We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We…
We give a normal form for families of 3-dimensional Poisson structures. This allows us to classify singularities with nonzero 1-jet and typical bifurcations. The Appendix contains corollaries on classification of families of integrable…
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous…
Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…
It is known by results of Dyckerhoff-Kapranov and of G\'alvez--Carrillo-Kock-Tonks that the output of the Waldhausen S.-construction has a unital 2-Segal structure. Here, we prove that a certain S.-functor defines an equivalence between the…
Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…