Advanced search options

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

Language: English ^{❌}

You searched for `subject:(covering group)`

.
Showing records 1 – 5 of
5 total matches.

▼ Search Limiters

University of Alabama

1. Green, Michael Timothy. Graphs of groups.

Degree: 2012, University of Alabama

URL: http://purl.lib.ua.edu/55036

► Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, SL2 (1977), whose first English translation was Trees in 1980.…
(more)

Subjects/Keywords: Electronic Thesis or Dissertation; – thesis; Mathematics; covering; graph; graphs of groups; group; path; path-lifting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Green, M. T. (2012). Graphs of groups. (Thesis). University of Alabama. Retrieved from http://purl.lib.ua.edu/55036

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

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

Green, Michael Timothy. “Graphs of groups.” 2012. Thesis, University of Alabama. Accessed September 26, 2020. http://purl.lib.ua.edu/55036.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Green, Michael Timothy. “Graphs of groups.” 2012. Web. 26 Sep 2020.

Vancouver:

Green MT. Graphs of groups. [Internet] [Thesis]. University of Alabama; 2012. [cited 2020 Sep 26]. Available from: http://purl.lib.ua.edu/55036.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Green MT. Graphs of groups. [Thesis]. University of Alabama; 2012. Available from: http://purl.lib.ua.edu/55036

Not specified: Masters Thesis or Doctoral Dissertation

Boston College

2.
Cai, Yuanqing.
Theta representations on *covering* groups.

Degree: PhD, Mathematics, 2017, Boston College

URL: http://dlib.bc.edu/islandora/object/bc-ir:107492

► Kazhdan and Patterson constructed generalized theta representations on covers of general linear groups as multi-residues of the Borel Eisenstein series. For the double covers, these…
(more)

Subjects/Keywords: covering group; doubling construction; Fourier coefficient; semi-Whittaker coefficient; Theta representation; unipotent orbit

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cai, Y. (2017). Theta representations on covering groups. (Doctoral Dissertation). Boston College. Retrieved from http://dlib.bc.edu/islandora/object/bc-ir:107492

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

Cai, Yuanqing. “Theta representations on covering groups.” 2017. Doctoral Dissertation, Boston College. Accessed September 26, 2020. http://dlib.bc.edu/islandora/object/bc-ir:107492.

MLA Handbook (7^{th} Edition):

Cai, Yuanqing. “Theta representations on covering groups.” 2017. Web. 26 Sep 2020.

Vancouver:

Cai Y. Theta representations on covering groups. [Internet] [Doctoral dissertation]. Boston College; 2017. [cited 2020 Sep 26]. Available from: http://dlib.bc.edu/islandora/object/bc-ir:107492.

Council of Science Editors:

Cai Y. Theta representations on covering groups. [Doctoral Dissertation]. Boston College; 2017. Available from: http://dlib.bc.edu/islandora/object/bc-ir:107492

3.
Francetic, Nevena.
* Covering* Arrays with Row Limit.

Degree: 2012, University of Toronto

URL: http://hdl.handle.net/1807/34006

►

*Covering* arrays with row limit, CARLs, are a new family of combinatorial objects which we introduce as a generalization of *group* divisible designs and *covering*…
(more)

Subjects/Keywords: group divisible designs; covering arrays; group divisible covering desings; graph covering problem; packing arrays; group divisible packing designs; 0405

…u2
us
of type g1
g2 . . . gs
GDCD
*group* divisible *covering* design
27
GDP D
*group*… …we introduce as a generalization of *group* divisible designs and *covering*
arrays, two well… …characteristics of *group* divisible designs and *covering*
arrays which lead to the definition and study of… …is a constant, we construct *group* divisible
*covering* designs with block size four rather… …*covering* designs.
Definition 3.3. A *group* divisible *covering* design, a GDCD for short, with index…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Francetic, N. (2012). Covering Arrays with Row Limit. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/34006

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

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Doctoral Dissertation, University of Toronto. Accessed September 26, 2020. http://hdl.handle.net/1807/34006.

MLA Handbook (7^{th} Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Web. 26 Sep 2020.

Vancouver:

Francetic N. Covering Arrays with Row Limit. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1807/34006.

Council of Science Editors:

Francetic N. Covering Arrays with Row Limit. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/34006

4.
Reese, Randall Dean.
Topics Pertaining to the *Group* Matrix: k-Characters and Random Walks.

Degree: MS, 2015, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

► Linear characters of finite groups can be extended to take k operands. The basics of such a k-fold extension are detailed. We then examine a…
(more)

Subjects/Keywords: k-characters; group determinant; random walks; branched covering; Mathematics

…*group* algebra CG. Explicitly,
G = {g1 , g2 , . . . , gn } (these forming the… …*group* G, let Irr(G) = {χ1 , χ2 , . . . , χk }. The regular character
π can… …x5B;31, p. 19] The number of irreducible characters of a *group* G is equal to the
number… …x29; for use in factoring the *group* determinant.
Chapter 2 will further explicate this topic… …character table of a *group* G is an invertible matrix.
Example. A *group* of relative importance in…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Reese, R. D. (2015). Topics Pertaining to the Group Matrix: k-Characters and Random Walks. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

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

Reese, Randall Dean. “Topics Pertaining to the Group Matrix: k-Characters and Random Walks.” 2015. Masters Thesis, Brigham Young University. Accessed September 26, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd.

MLA Handbook (7^{th} Edition):

Reese, Randall Dean. “Topics Pertaining to the Group Matrix: k-Characters and Random Walks.” 2015. Web. 26 Sep 2020.

Vancouver:

Reese RD. Topics Pertaining to the Group Matrix: k-Characters and Random Walks. [Internet] [Masters thesis]. Brigham Young University; 2015. [cited 2020 Sep 26]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd.

Council of Science Editors:

Reese RD. Topics Pertaining to the Group Matrix: k-Characters and Random Walks. [Masters Thesis]. Brigham Young University; 2015. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6569&context=etd

5.
Chodoriwsky, Jacob N.
Error Locating Arrays, Adaptive Software Testing, and Combinatorial *Group* Testing
.

Degree: 2012, University of Ottawa

URL: http://hdl.handle.net/10393/23083

► Combinatorial *Group* Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs…
(more)

Subjects/Keywords: combinatorial group testing; CGT; error locating arrays; ELA; covering arrays; CA; adaptive; algorithm; testing problem; software testing; CAFE; forbidden edges; forbidden hyperedges; hypergraph testing; group testing for complexes; safe values

…Such designs are arrays whose rows represent corresponding tests.
1.2
*Covering* Arrays
A… …*covering* array (CA) is a type of combinatorial design which, given a parameter t… …covers each t-way interaction at least once. More formally, we deﬁne a *covering* array
as… …follows.
Definition 1.2.1 A *covering* array C is an N × k array with entries from a galphabet… …*covering* array number, which we denote by CAN (t, k, g). A *covering* array
of size N…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chodoriwsky, J. N. (2012). Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23083

Not specified: Masters Thesis or Doctoral Dissertation

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

Chodoriwsky, Jacob N. “Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .” 2012. Thesis, University of Ottawa. Accessed September 26, 2020. http://hdl.handle.net/10393/23083.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chodoriwsky, Jacob N. “Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .” 2012. Web. 26 Sep 2020.

Vancouver:

Chodoriwsky JN. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . [Internet] [Thesis]. University of Ottawa; 2012. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10393/23083.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chodoriwsky JN. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . [Thesis]. University of Ottawa; 2012. Available from: http://hdl.handle.net/10393/23083

Not specified: Masters Thesis or Doctoral Dissertation