Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(orthogonality graph)`

.
Showing records 1 – 2 of
2 total matches.

▼ Search Limiters

Delft University of Technology

1. Suparta, I.N. Counting sequences, Gray codes and lexicodes.

Degree: 2006, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3

A counting sequence of length n is a list of all 2^n binary n-tuples (binary codewords of length n). The number of bit positions where two codewords differ is called the Hamming distance of these two codewords. The average Hamming distance of a counting sequence of length n is defined as the average Hamming distance between the 2^n pairs of successive codewords, including the pair of the last and the first codeword. A counting sequence of length n which has average Hamming distance equal to n-1/2 is called a maximum counting sequence. The number of bit changes in bit position i, in a counting sequence of length n is called the transition count of bit position i. If a counting sequence of length n has the property that the difference between any two bit positions is at most 2, the sequence is called balanced. We introduce a construction for balanced maximum counting sequences for every codeword length n>0, n not equal 4, which implies a proof of a longstanding conjecture of Robinson and Cohn in [IEEE Trans. Computers, vol. C-30, pp. 17-23, 1981]. A counting sequence of length n which has the property that any two successive codewords in the list have the same Hamming distance is called uniform. We introduce a heuristic construction how to construct uniform sequences. This construction occasionally produces balanced sequences, and so gives a partial answer to another conjecture of Robinson and Cohn dealing with the existence of balanced uniform counting sequences [IEEE Trans. Computers, vol. C-30, pp. 17-23, 1981]. A cyclic Gray code of length n is a uniform sequence of length n with Hamming distance exactly one between any two successive codewords. We introduce a construction of Gray codes satisfying the property that either all transition counts are equal to the same power of two, or are all equal to two consecutive powers of two, which proves the conjecture of Wagner and West in [Congressus Numerantium, vol. 80, pp. 217-223, 1991]. Furthermore, we also introduce a construction of Gray codes of length n>0, n not equal 3, inducing the complete graph K_n, thus providing the complete answer for an open problem suggested by Wilmer and Ernst in [Discrete Mathematics, vol. 257, pp. 585-598, 2002]. Moreover, we derive the separability function of the reflected N-ary Gray codes. We also introduce a simple method for the construction of cyclic N-ary Gray codes, and for the construction of constant weight N-ary Gray codes. The separability functions of these codes are derived as well. In the remaining part of the thesis we present a greedy algorithm for the construction of a large class of linear q-ary lexicodes which generalizes the algorithms in several other papers. By applying this method, one can produce linear lexicodes which cannot be constructed by previous algorithms. Especially, we discuss some interesting properties of self-orthogonal ternary lexicodes.
*Advisors/Committee Members: Van Zanten, A.J..*

Subjects/Keywords: complete graph; counting sequence; gray code; greedy algorithm; lexicode; linearity; maximum counting sequence; self-orthogonality; self-duality; separability; uniform counting sequence

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Suparta, I. N. (2006). Counting sequences, Gray codes and lexicodes. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3

Chicago Manual of Style (16^{th} Edition):

Suparta, I N. “Counting sequences, Gray codes and lexicodes.” 2006. Doctoral Dissertation, Delft University of Technology. Accessed August 04, 2020. http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3.

MLA Handbook (7^{th} Edition):

Suparta, I N. “Counting sequences, Gray codes and lexicodes.” 2006. Web. 04 Aug 2020.

Vancouver:

Suparta IN. Counting sequences, Gray codes and lexicodes. [Internet] [Doctoral dissertation]. Delft University of Technology; 2006. [cited 2020 Aug 04]. Available from: http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3.

Council of Science Editors:

Suparta IN. Counting sequences, Gray codes and lexicodes. [Doctoral Dissertation]. Delft University of Technology; 2006. Available from: http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; urn:NBN:nl:ui:24-uuid:975a4a47-7935-4f76-9503-6d4e36b674a3 ; http://resolver.tudelft.nl/uuid:975a4a47-7935-4f76-9503-6d4e36b674a3

Delft University of Technology

2. DeCorte, P.E.B. The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c

This thesis is about maximum independent set and chromatic number problems on certain kinds of infinite graphs. A typical example comes from the Witsenhausen problem: For n ≥ 2, let S^{n-1} := { x ∈ \R^{n} : \|x\|_{2} =1 } be the unit sphere in \R^{n}, and let G=(V,E) be the graph with V = S^{n-1}, in which two points in S^{n-1} are adjacent if and only if their inner product is equal to 0. What is the largest possible Lebesgue measure of an independent set in G? The problem is reminiscent of a coding theory problem, in which one asks for the size of a largest set of distinct points in some metric space so that the distance between each pair of points is at least some specified constant d. Such a problem can be framed as a maximum independent set problem: Define a graph whose vertex set is the metric space, and join two points with an edge whenever their distance is less than d. The codes of minimum distance d are then precisely the independent sets in this graph. In the Witsenhausen problem, rather than asking for a set of points in the sphere in which all the distances less than d are forbidden, we ask for a set of points in which only one distance is forbidden. And it turns out that the \emph{Delsarte} (also called \emph{linear programming}) upper bounds for the size of codes can be adjusted to give upper bounds for the measure of an independent set in the Witsenhausen graph. This was first done in and . The Witsenhausen problem was stated in , and in the same note it was shown that the fraction of the n-dimensional sphere which can be occupied by any measurable independent set is upper bounded by the function 1/n. Frankl and Wilson made a breakthrough in 1981 when they proved an upper bound which decreases exponentially in n. Despite this progress on asymptotics, the 1/3 upper bound in the n=3 case has not moved since the original statement of the problem until now. In Chapter \ref{ch:opp} we give one of the main results of the thesis, which is an improvement of this upper bound to 0.313. The proof works by strengthening the Delsarte-type bounds using some combinatorial arguments deduced in Chapters \ref{ch:opp-background} and \ref{ch:circular}. The next main result of the thesis answers a natural question about the graphs G(S^{n-1}, X), whose vertex set is S^{n-1} and where two points are joined with an edge if and only if their inner product belongs to the set X \subset [-1,1] of forbidden inner products. These graphs generalize the Witsenhausen graph, and are called \emph{forbidden inner product graphs}. One may ask, Does there exist a measurable independent set of maximum measure? There is a graph G = G(S^{2}, X) (many, in fact) having no such independent set. In Chapter \ref{ch:circular} we construct for every \e>0 an independent set in G having measure at least 1/2 - \e, but we show that there is no independent set of measure equal to 1/2. In Chapters…
*Advisors/Committee Members: Vallentin, F., Aardal, K.I..*

Subjects/Keywords: Eigenvalue method; Delsarte code bounds; Lovasz theta function; infinite graphs; harmonic analysis; orthogonality graph; Witsenhausen problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

DeCorte, P. E. B. (2015). The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c

Chicago Manual of Style (16^{th} Edition):

DeCorte, P E B. “The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs.” 2015. Doctoral Dissertation, Delft University of Technology. Accessed August 04, 2020. http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c.

MLA Handbook (7^{th} Edition):

DeCorte, P E B. “The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs.” 2015. Web. 04 Aug 2020.

Vancouver:

DeCorte PEB. The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs. [Internet] [Doctoral dissertation]. Delft University of Technology; 2015. [cited 2020 Aug 04]. Available from: http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c.

Council of Science Editors:

DeCorte PEB. The Eigenvalue Method for Extremal Problems on Infinite Vertex-Transitive Graphs. [Doctoral Dissertation]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; urn:NBN:nl:ui:24-uuid:da16eb76-4031-4350-baf3-307aa01a337c ; http://resolver.tudelft.nl/uuid:da16eb76-4031-4350-baf3-307aa01a337c