718 research outputs found
Inferring an Indeterminate String from a Prefix Graph
An \itbf{indeterminate string} (or, more simply, just a \itbf{string}) \s{x}
= \s{x}[1..n] on an alphabet is a sequence of nonempty subsets of
. We say that \s{x}[i_1] and \s{x}[i_2] \itbf{match} (written
\s{x}[i_1] \match \s{x}[i_2]) if and only if \s{x}[i_1] \cap \s{x}[i_2] \ne
\emptyset. A \itbf{feasible array} is an array \s{y} = \s{y}[1..n] of
integers such that \s{y}[1] = n and for every , \s{y}[i] \in
0..n\- i\+ 1. A \itbf{prefix table} of a string \s{x} is an array \s{\pi} =
\s{\pi}[1..n] of integers such that, for every , \s{\pi}[i] = j
if and only if \s{x}[i..i\+ j\- 1] is the longest substring at position
of \s{x} that matches a prefix of \s{x}. It is known from \cite{CRSW13} that
every feasible array is a prefix table of some indetermintate string. A
\itbf{prefix graph} \mathcal{P} = \mathcal{P}_{\s{y}} is a labelled simple
graph whose structure is determined by a feasible array \s{y}. In this paper we
show, given a feasible array \s{y}, how to use \mathcal{P}_{\s{y}} to
construct a lexicographically least indeterminate string on a minimum alphabet
whose prefix table \s{\pi} = \s{y}.Comment: 13 pages, 1 figur
THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References
and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a
New strongly regular graphs from finite geometries via switching
We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type U(n, 2), O(n, 3), O(n, 5), O+ (n, 3), and O- (n, 3) are not determined by its parameters for n >= 6. We prove this by using a variation of Godsil-McKay switching recently described by Wang, Qiu, and Hu. This also results in a new, shorter proof of a previous result of the first author which showed that the collinearity graph of a polar space is not determined by its spectrum. The same switching gives a linear algebra explanation for the construction of a large number of non-isomorphic designs. (C) 2019 Elsevier Inc. All rights reserved
The zero forcing polynomial of a graph
Zero forcing is an iterative graph coloring process, where given a set of
initially colored vertices, a colored vertex with a single uncolored neighbor
causes that neighbor to become colored. A zero forcing set is a set of
initially colored vertices which causes the entire graph to eventually become
colored. In this paper, we study the counting problem associated with zero
forcing. We introduce the zero forcing polynomial of a graph of order
as the polynomial , where is
the number of zero forcing sets of of size . We characterize the
extremal coefficients of , derive closed form expressions for
the zero forcing polynomials of several families of graphs, and explore various
structural properties of , including multiplicativity,
unimodality, and uniqueness.Comment: 23 page
New Strongly Regular Graphs from Finite Geometries via Switching
We show that the strongly regular graph on non-isotropic points of one type
of the polar spaces of type , , , , and
are not determined by its parameters for . We prove this
by using a variation of Godsil-McKay switching recently described by Wang, Qiu,
and Hu. This also results in a new, shorter proof of a previous result of the
first author which showed that the collinearity graph of a polar space is not
determined by its spectrum. The same switching gives a linear algebra
explanation for the construction of a large number of non-isomorphic designs.Comment: 13 pages, accepted in Linear Algebra and Its Application
A geometric protocol for cryptography with cards
In the generalized Russian cards problem, the three players Alice, Bob and
Cath draw a,b and c cards, respectively, from a deck of a+b+c cards. Players
only know their own cards and what the deck of cards is. Alice and Bob are then
required to communicate their hand of cards to each other by way of public
messages. The communication is said to be safe if Cath does not learn the
ownership of any specific card; in this paper we consider a strengthened notion
of safety introduced by Swanson and Stinson which we call k-safety.
An elegant solution by Atkinson views the cards as points in a finite
projective plane. We propose a general solution in the spirit of Atkinson's,
although based on finite vector spaces rather than projective planes, and call
it the `geometric protocol'. Given arbitrary c,k>0, this protocol gives an
informative and k-safe solution to the generalized Russian cards problem for
infinitely many values of (a,b,c) with b=O(ac). This improves on the collection
of parameters for which solutions are known. In particular, it is the first
solution which guarantees -safety when Cath has more than one card
- …