Related papers: How Much String to String a Cardioid?
The main idea in the present work is the definition of an experimental proposal for the detection of the number of extra{compact dimensions contained as a core feature in String Theory. This goal will be achieved as a consequence of the…
We study the problem of cutting a length-$n$ string of positive real numbers into $k$ pieces so that every piece has sum at least $b$. The problem can also be phrased as transforming such a string into a new one by merging adjacent numbers.…
The stick number of a knot is the minimum number of segments needed to build a polygonal version of the knot. Despite its elementary definition and relevance to physical knots, the stick number is poorly understood: for most knots we only…
A residual design ${\cal{D}}_B$ with respect to a block $B$ of a given design $\cal{D}$ is defined to be linearly embeddable over $GF(p)$ if the $p$-ranks of the incidence matrices of ${\cal{D}}_B$ and $\cal{D}$ differ by one. A sufficient…
String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper…
We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle $\mathcal{C}$ bounding a face. Each edge of the graph that is not in $\mathcal{C}$, a chord, is assigned a length equal to the length of the shortest…
We review techniques simplifying the analytic calculation of one-loop QCD amplitudes with many external legs, for use in next-to-leading-order corrections to multi-jet processes. We explain how a supersymmetry-inspired organization works…
In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the "master design") and then uses a second design (the "indexing design") to take certain unions of blocks in each…
Suppose we are asked to preprocess a string \(s [1..n]\) such that later, given a substring's endpoints, we can quickly count how many distinct characters it contains. In this paper we give a data structure for this problem that takes \(n…
For positive integers $n$ and $k$ with $n \geq k$, an $(n,k,1)$-design is a pair $(V, \mathcal{B})$ where $V$ is a set of $n$ points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ called blocks such that each pair of points occur…
We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.
Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…
In this paper we discuss the number of regions in a unit circle after drawing $n$ i.i.d. random chords in the circle according to a particular family of distribution. We find that as $n$ goes to infinity, the distribution of the number of…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal…
The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of…
We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…
In the present paper, we construct 3-designs using extended binary quadratic residue codes and their dual codes.