Advanced search options

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

You searched for `subject:(Matroid theory)`

.
Showing records 1 – 19 of
19 total matches.

▼ Search Limiters

Victoria University of Wellington

1. Welsh, Michael. Golden-Mean and Secret Sharing Matroids.

Degree: 2011, Victoria University of Wellington

URL: http://hdl.handle.net/10063/1683

► Maximum-sized results are an important part of *matroid* *theory*, and results currently exist for various classes of matroids. Archer conjectured that the maximum-sized golden-mean matroids…
(more)

Subjects/Keywords: Matroid theory; Secret sharing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Welsh, M. (2011). Golden-Mean and Secret Sharing Matroids. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1683

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

Welsh, Michael. “Golden-Mean and Secret Sharing Matroids.” 2011. Masters Thesis, Victoria University of Wellington. Accessed December 05, 2020. http://hdl.handle.net/10063/1683.

MLA Handbook (7^{th} Edition):

Welsh, Michael. “Golden-Mean and Secret Sharing Matroids.” 2011. Web. 05 Dec 2020.

Vancouver:

Welsh M. Golden-Mean and Secret Sharing Matroids. [Internet] [Masters thesis]. Victoria University of Wellington; 2011. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10063/1683.

Council of Science Editors:

Welsh M. Golden-Mean and Secret Sharing Matroids. [Masters Thesis]. Victoria University of Wellington; 2011. Available from: http://hdl.handle.net/10063/1683

Victoria University of Wellington

2. Prideaux, Kadin. Matroids, Cyclic Flats, and Polyhedra.

Degree: 2016, Victoria University of Wellington

URL: http://hdl.handle.net/10063/5204

► Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are…
(more)

Subjects/Keywords: Matroid theory; Discrete geometry; Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Prideaux, K. (2016). Matroids, Cyclic Flats, and Polyhedra. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5204

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

Prideaux, Kadin. “Matroids, Cyclic Flats, and Polyhedra.” 2016. Masters Thesis, Victoria University of Wellington. Accessed December 05, 2020. http://hdl.handle.net/10063/5204.

MLA Handbook (7^{th} Edition):

Prideaux, Kadin. “Matroids, Cyclic Flats, and Polyhedra.” 2016. Web. 05 Dec 2020.

Vancouver:

Prideaux K. Matroids, Cyclic Flats, and Polyhedra. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10063/5204.

Council of Science Editors:

Prideaux K. Matroids, Cyclic Flats, and Polyhedra. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5204

Victoria University of Wellington

3. Hall, Jasmine. Generalizing the Algebra of Throws to Rank-3 Matroids.

Degree: 2016, Victoria University of Wellington

URL: http://hdl.handle.net/10063/5160

► The algebra of throws is a geometric construction which reveals the underlying algebraic operations of addition and multiplication in a projective plane. In Desarguesian projective…
(more)

Subjects/Keywords: Matroid theory; Algebra of throws; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hall, J. (2016). Generalizing the Algebra of Throws to Rank-3 Matroids. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5160

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

Hall, Jasmine. “Generalizing the Algebra of Throws to Rank-3 Matroids.” 2016. Masters Thesis, Victoria University of Wellington. Accessed December 05, 2020. http://hdl.handle.net/10063/5160.

MLA Handbook (7^{th} Edition):

Hall, Jasmine. “Generalizing the Algebra of Throws to Rank-3 Matroids.” 2016. Web. 05 Dec 2020.

Vancouver:

Hall J. Generalizing the Algebra of Throws to Rank-3 Matroids. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10063/5160.

Council of Science Editors:

Hall J. Generalizing the Algebra of Throws to Rank-3 Matroids. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5160

California State University – San Bernardino

4. Rocha, Maria Margarita. Tutte-Equivalent Matroids.

Degree: MAin Mathematics, Mathematics, 2018, California State University – San Bernardino

URL: https://scholarworks.lib.csusb.edu/etd/759

► We begin by introducing matroids in the context of finite collections of vectors from a vector space over a specified field, where the notion…
(more)

Subjects/Keywords: Matroid Theory; Tutte Polynomail; Invariants; graph theory; linear algebra; Discrete Mathematics and Combinatorics; Set Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rocha, M. M. (2018). Tutte-Equivalent Matroids. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/759

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):

Rocha, Maria Margarita. “Tutte-Equivalent Matroids.” 2018. Thesis, California State University – San Bernardino. Accessed December 05, 2020. https://scholarworks.lib.csusb.edu/etd/759.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rocha, Maria Margarita. “Tutte-Equivalent Matroids.” 2018. Web. 05 Dec 2020.

Vancouver:

Rocha MM. Tutte-Equivalent Matroids. [Internet] [Thesis]. California State University – San Bernardino; 2018. [cited 2020 Dec 05]. Available from: https://scholarworks.lib.csusb.edu/etd/759.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rocha MM. Tutte-Equivalent Matroids. [Thesis]. California State University – San Bernardino; 2018. Available from: https://scholarworks.lib.csusb.edu/etd/759

Not specified: Masters Thesis or Doctoral Dissertation

5. Shyni, Philip; Dr.Chakravarti, R S. Studies on Fuzzy Matroitls and Related Topics.

Degree: Mathematics, 2010, Cochin University of Science and Technology

URL: http://dyuthi.cusat.ac.in/purl/3119

►

The doctoral thesis focuses on the Studies on fuzzy Matroids and related topics.Since the publication of the classical paper on fuzzy sets by L. A.… (more)

Subjects/Keywords: Fuzzy Matroid; Convexity theory; Fuzzy set theory; fuzzy independent structure; FCP and FCC mapping

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shyni, Philip; Dr.Chakravarti, R. S. (2010). Studies on Fuzzy Matroitls and Related Topics. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/3119

Not specified: Masters Thesis or Doctoral Dissertation

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

Shyni, Philip; Dr.Chakravarti, R S. “Studies on Fuzzy Matroitls and Related Topics.” 2010. Thesis, Cochin University of Science and Technology. Accessed December 05, 2020. http://dyuthi.cusat.ac.in/purl/3119.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shyni, Philip; Dr.Chakravarti, R S. “Studies on Fuzzy Matroitls and Related Topics.” 2010. Web. 05 Dec 2020.

Vancouver:

Shyni, Philip; Dr.Chakravarti RS. Studies on Fuzzy Matroitls and Related Topics. [Internet] [Thesis]. Cochin University of Science and Technology; 2010. [cited 2020 Dec 05]. Available from: http://dyuthi.cusat.ac.in/purl/3119.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shyni, Philip; Dr.Chakravarti RS. Studies on Fuzzy Matroitls and Related Topics. [Thesis]. Cochin University of Science and Technology; 2010. Available from: http://dyuthi.cusat.ac.in/purl/3119

Not specified: Masters Thesis or Doctoral Dissertation

University of North Texas

6. Mecay, Stefan Terence. Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7.

Degree: 2000, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc2514/

► Let M be the class of simple matroids which do not contain the 5-point line U2,5 , the Fano plane F7 , the non-Fano plane…
(more)

Subjects/Keywords: Matroids.; Set theory.; Set theory; Matroid

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mecay, S. T. (2000). Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc2514/

Not specified: Masters Thesis or Doctoral Dissertation

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

Mecay, Stefan Terence. “Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7.” 2000. Thesis, University of North Texas. Accessed December 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc2514/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mecay, Stefan Terence. “Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7.” 2000. Web. 05 Dec 2020.

Vancouver:

Mecay ST. Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7. [Internet] [Thesis]. University of North Texas; 2000. [cited 2020 Dec 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc2514/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mecay ST. Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7. [Thesis]. University of North Texas; 2000. Available from: https://digital.library.unt.edu/ark:/67531/metadc2514/

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

7. Brown, Adam. Counting Pentagons in Triangle-free Binary Matroids.

Degree: 2020, University of Waterloo

URL: http://hdl.handle.net/10012/16089

► A rank-n binary *matroid* is a spanning subset E of F₂ⁿ{0}, a triangle is a set of three elements from E which sum to zero,…
(more)

Subjects/Keywords: additive combinatorics; fourier analysis; coding theory; triangle-free binary matroid; pentagon counting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brown, A. (2020). Counting Pentagons in Triangle-free Binary Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16089

Not specified: Masters Thesis or Doctoral Dissertation

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

Brown, Adam. “Counting Pentagons in Triangle-free Binary Matroids.” 2020. Thesis, University of Waterloo. Accessed December 05, 2020. http://hdl.handle.net/10012/16089.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Brown, Adam. “Counting Pentagons in Triangle-free Binary Matroids.” 2020. Web. 05 Dec 2020.

Vancouver:

Brown A. Counting Pentagons in Triangle-free Binary Matroids. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10012/16089.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brown A. Counting Pentagons in Triangle-free Binary Matroids. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16089

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

8.
Brettell, Nicholas John.
Aspects of *Matroid* Connectivity.

Degree: School of Mathematics and Statistics, 2014, University of Canterbury

URL: http://hdl.handle.net/10092/9215

► Connectivity is a fundamental tool for *matroid* theorists, which has become increasingly important in the eventual solution of many problems in *matroid* *theory*. Loosely speaking,…
(more)

Subjects/Keywords: matroid theory; connectivity; chain theorem; splitter theorem; tree decomposition; k-tree; polynomial-time algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brettell, N. J. (2014). Aspects of Matroid Connectivity. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/9215

Not specified: Masters Thesis or Doctoral Dissertation

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

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Thesis, University of Canterbury. Accessed December 05, 2020. http://hdl.handle.net/10092/9215.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Web. 05 Dec 2020.

Vancouver:

Brettell NJ. Aspects of Matroid Connectivity. [Internet] [Thesis]. University of Canterbury; 2014. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10092/9215.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brettell NJ. Aspects of Matroid Connectivity. [Thesis]. University of Canterbury; 2014. Available from: http://hdl.handle.net/10092/9215

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

9. Patta, Vaia. Aspects of categorical physics : a category for modelling dependence relations and a generalised entropy functor.

Degree: PhD, 2018, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:8bfd2a2d-524e-4ffa-953b-33d66ba186ed ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757908

► Two applications of Category *Theory* are considered. The link between them is applications to Physics and more specifically to Entropy. The first research chapter is…
(more)

Subjects/Keywords: 004; Thermodynamics; Matroid Theory; Categories (Mathematics); Categorical Physics; Entropy; Diagrammatic reasoning; Strong maps (matroids)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Patta, V. (2018). Aspects of categorical physics : a category for modelling dependence relations and a generalised entropy functor. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:8bfd2a2d-524e-4ffa-953b-33d66ba186ed ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757908

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

Patta, Vaia. “Aspects of categorical physics : a category for modelling dependence relations and a generalised entropy functor.” 2018. Doctoral Dissertation, University of Oxford. Accessed December 05, 2020. http://ora.ox.ac.uk/objects/uuid:8bfd2a2d-524e-4ffa-953b-33d66ba186ed ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757908.

MLA Handbook (7^{th} Edition):

Patta, Vaia. “Aspects of categorical physics : a category for modelling dependence relations and a generalised entropy functor.” 2018. Web. 05 Dec 2020.

Vancouver:

Patta V. Aspects of categorical physics : a category for modelling dependence relations and a generalised entropy functor. [Internet] [Doctoral dissertation]. University of Oxford; 2018. [cited 2020 Dec 05]. Available from: http://ora.ox.ac.uk/objects/uuid:8bfd2a2d-524e-4ffa-953b-33d66ba186ed ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757908.

Council of Science Editors:

Patta V. Aspects of categorical physics : a category for modelling dependence relations and a generalised entropy functor. [Doctoral Dissertation]. University of Oxford; 2018. Available from: http://ora.ox.ac.uk/objects/uuid:8bfd2a2d-524e-4ffa-953b-33d66ba186ed ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757908

University of Canterbury

10.
Brettell, Nicholas John.
Aspects of *Matroid* Connectivity.

Degree: PhD, Mathematics, 2014, University of Canterbury

URL: http://dx.doi.org/10.26021/1596

► Connectivity is a fundamental tool for *matroid* theorists, which has become increasingly important in the eventual solution of many problems in *matroid* *theory*. Loosely speaking,…
(more)

Subjects/Keywords: matroid theory; connectivity; chain theorem; splitter theorem; tree decomposition; k-tree; polynomial-time algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brettell, N. J. (2014). Aspects of Matroid Connectivity. (Doctoral Dissertation). University of Canterbury. Retrieved from http://dx.doi.org/10.26021/1596

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

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Doctoral Dissertation, University of Canterbury. Accessed December 05, 2020. http://dx.doi.org/10.26021/1596.

MLA Handbook (7^{th} Edition):

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Web. 05 Dec 2020.

Vancouver:

Brettell NJ. Aspects of Matroid Connectivity. [Internet] [Doctoral dissertation]. University of Canterbury; 2014. [cited 2020 Dec 05]. Available from: http://dx.doi.org/10.26021/1596.

Council of Science Editors:

Brettell NJ. Aspects of Matroid Connectivity. [Doctoral Dissertation]. University of Canterbury; 2014. Available from: http://dx.doi.org/10.26021/1596

York University

11. Eftekhari, Yaser. Geometry of Point-Hyperplane and Spherical Frameworks.

Degree: PhD, Mathematics & Statistics, 2018, York University

URL: http://hdl.handle.net/10315/34341

► In this thesis we show that the infinitesimal rigidity of point-hyperplane frameworks in Euclidean spaces is equivalent to the infinitesimal rigidity of bar-joint frameworks in…
(more)

Subjects/Keywords: Mathematics; Geometry; Discrete geometry; Rigidity of frameworks; Infinitesimal rigidity; Static rigidity; Combinatorics; Matroid theory; Tensegrity frameworks; CAD constraints

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Eftekhari, Y. (2018). Geometry of Point-Hyperplane and Spherical Frameworks. (Doctoral Dissertation). York University. Retrieved from http://hdl.handle.net/10315/34341

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

Eftekhari, Yaser. “Geometry of Point-Hyperplane and Spherical Frameworks.” 2018. Doctoral Dissertation, York University. Accessed December 05, 2020. http://hdl.handle.net/10315/34341.

MLA Handbook (7^{th} Edition):

Eftekhari, Yaser. “Geometry of Point-Hyperplane and Spherical Frameworks.” 2018. Web. 05 Dec 2020.

Vancouver:

Eftekhari Y. Geometry of Point-Hyperplane and Spherical Frameworks. [Internet] [Doctoral dissertation]. York University; 2018. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/10315/34341.

Council of Science Editors:

Eftekhari Y. Geometry of Point-Hyperplane and Spherical Frameworks. [Doctoral Dissertation]. York University; 2018. Available from: http://hdl.handle.net/10315/34341

University of Oxford

12. Mayhew, Dillon. Matroids and complexity.

Degree: PhD, 2005, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:23640923-17c3-4ad8-9845-320e3b662910 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418481

► We consider different ways of describing a *matroid* to a Turing machine by listing the members of various families of subsets, and we construct an…
(more)

Subjects/Keywords: 511.6; Combinatorics; matroid theory; complexity; basis-graph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mayhew, D. (2005). Matroids and complexity. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:23640923-17c3-4ad8-9845-320e3b662910 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418481

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

Mayhew, Dillon. “Matroids and complexity.” 2005. Doctoral Dissertation, University of Oxford. Accessed December 05, 2020. http://ora.ox.ac.uk/objects/uuid:23640923-17c3-4ad8-9845-320e3b662910 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418481.

MLA Handbook (7^{th} Edition):

Mayhew, Dillon. “Matroids and complexity.” 2005. Web. 05 Dec 2020.

Vancouver:

Mayhew D. Matroids and complexity. [Internet] [Doctoral dissertation]. University of Oxford; 2005. [cited 2020 Dec 05]. Available from: http://ora.ox.ac.uk/objects/uuid:23640923-17c3-4ad8-9845-320e3b662910 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418481.

Council of Science Editors:

Mayhew D. Matroids and complexity. [Doctoral Dissertation]. University of Oxford; 2005. Available from: http://ora.ox.ac.uk/objects/uuid:23640923-17c3-4ad8-9845-320e3b662910 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418481

13. Gedeon, Katie. Kazhdan-Lusztig Polynomials of Matroids and Their Roots.

Degree: PhD, Department of Mathematics, 2018, University of Oregon

URL: http://hdl.handle.net/1794/23913

► The Kazhdan-Lusztig polynomial of a *matroid* M, denoted P_{M}( t ), was recently defined by Elias, Proudfoot, and Wakefield. These polynomials are analogous to the…
(more)

Subjects/Keywords: Kazhdan-Lusztig polynomials; Matroid theory; real-rootedness

…A.1 Kazhdan-Lusztig polynomials for the thagomizer *matroid* τn . . . . . 46
A.2 Kazhdan… …Lusztig polynomials for the fan *matroid* ∆n . . . . . . . . . . 47
xiii
CHAPTER I
INTRODUCTION… …laid out the analogy between this new *theory* and the classical *theory*
of Kazhdan-Lusztig… …this document, we focus on the combinatorial aspect of the *theory* for
matroids. In particular… …of the *matroid* associated to the complete
graph.
There is no reason to believe that…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gedeon, K. (2018). Kazhdan-Lusztig Polynomials of Matroids and Their Roots. (Doctoral Dissertation). University of Oregon. Retrieved from http://hdl.handle.net/1794/23913

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

Gedeon, Katie. “Kazhdan-Lusztig Polynomials of Matroids and Their Roots.” 2018. Doctoral Dissertation, University of Oregon. Accessed December 05, 2020. http://hdl.handle.net/1794/23913.

MLA Handbook (7^{th} Edition):

Gedeon, Katie. “Kazhdan-Lusztig Polynomials of Matroids and Their Roots.” 2018. Web. 05 Dec 2020.

Vancouver:

Gedeon K. Kazhdan-Lusztig Polynomials of Matroids and Their Roots. [Internet] [Doctoral dissertation]. University of Oregon; 2018. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/1794/23913.

Council of Science Editors:

Gedeon K. Kazhdan-Lusztig Polynomials of Matroids and Their Roots. [Doctoral Dissertation]. University of Oregon; 2018. Available from: http://hdl.handle.net/1794/23913

14. El Rouayheb, Salim Y. Network and Index Coding with Application to Robust and Secure Communications.

Degree: PhD, Electrical Engineering, 2011, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7364

► Since its introduction in the year 2000 by Ahlswede et al., the network coding paradigm has revolutionized the way we understand information flows in networks.…
(more)

Subjects/Keywords: Network Coding; Index Coding; Matroid Theory; Communications

…Coding . . . . . . . .
C. Connection to Network Coding . .
D. Connection to *Matroid* *Theory*… …1. Overview of *Matroid* *Theory* .
2. From Matroids to Index Codes
E. Properties of Index… …establishes a strong relation between network coding and *matroid*
*theory*, and constitutes a means to… …apply numerous results in the rich field of *matroid*
*theory* to communication problems in… …Codes and *Matroid* Representation
E. Literature Overview . . . . . . . . . . . . . . .
F…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

El Rouayheb, S. Y. (2011). Network and Index Coding with Application to Robust and Secure Communications. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7364

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

El Rouayheb, Salim Y. “Network and Index Coding with Application to Robust and Secure Communications.” 2011. Doctoral Dissertation, Texas A&M University. Accessed December 05, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7364.

MLA Handbook (7^{th} Edition):

El Rouayheb, Salim Y. “Network and Index Coding with Application to Robust and Secure Communications.” 2011. Web. 05 Dec 2020.

Vancouver:

El Rouayheb SY. Network and Index Coding with Application to Robust and Secure Communications. [Internet] [Doctoral dissertation]. Texas A&M University; 2011. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7364.

Council of Science Editors:

El Rouayheb SY. Network and Index Coding with Application to Robust and Secure Communications. [Doctoral Dissertation]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7364

University of Pennsylvania

15.
Henselman, Gregory.
Matroids And Canonical Forms: *Theory* And Applications.

Degree: 2017, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/2332

► This document introduces a combinatorial *theory* of homology, a topological descriptor of shape. The past fifteen years have seen a steady advance in the use…
(more)

Subjects/Keywords: Combinatorial Optimization; Jordan Canonical Form; Matrix Factorization; Matroid Representation; Morse Theory; Persistent Homology; Applied Mathematics; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Henselman, G. (2017). Matroids And Canonical Forms: Theory And Applications. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/2332

Not specified: Masters Thesis or Doctoral Dissertation

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

Henselman, Gregory. “Matroids And Canonical Forms: Theory And Applications.” 2017. Thesis, University of Pennsylvania. Accessed December 05, 2020. https://repository.upenn.edu/edissertations/2332.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Henselman, Gregory. “Matroids And Canonical Forms: Theory And Applications.” 2017. Web. 05 Dec 2020.

Vancouver:

Henselman G. Matroids And Canonical Forms: Theory And Applications. [Internet] [Thesis]. University of Pennsylvania; 2017. [cited 2020 Dec 05]. Available from: https://repository.upenn.edu/edissertations/2332.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Henselman G. Matroids And Canonical Forms: Theory And Applications. [Thesis]. University of Pennsylvania; 2017. Available from: https://repository.upenn.edu/edissertations/2332

Not specified: Masters Thesis or Doctoral Dissertation

University of Maryland

16.
Howard, Benjamin James.
Matroids and Geometric Invariant *Theory* of torus actions on flag spaces.

Degree: Mathematics, 2006, University of Maryland

URL: http://hdl.handle.net/1903/3392

► This thesis investigates the structure of the projective coordinate rings of SL(n,C) weight varieties. An SL(n,C) weight variety is a Geometric Invariant *Theory* quotient of…
(more)

Subjects/Keywords: Mathematics; matroid; torus; flag space; weight variety; Geometric Invariant Theory; Gelfand Tsetlin polytope

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howard, B. J. (2006). Matroids and Geometric Invariant Theory of torus actions on flag spaces. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/3392

Not specified: Masters Thesis or Doctoral Dissertation

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

Howard, Benjamin James. “Matroids and Geometric Invariant Theory of torus actions on flag spaces.” 2006. Thesis, University of Maryland. Accessed December 05, 2020. http://hdl.handle.net/1903/3392.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howard, Benjamin James. “Matroids and Geometric Invariant Theory of torus actions on flag spaces.” 2006. Web. 05 Dec 2020.

Vancouver:

Howard BJ. Matroids and Geometric Invariant Theory of torus actions on flag spaces. [Internet] [Thesis]. University of Maryland; 2006. [cited 2020 Dec 05]. Available from: http://hdl.handle.net/1903/3392.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howard BJ. Matroids and Geometric Invariant Theory of torus actions on flag spaces. [Thesis]. University of Maryland; 2006. Available from: http://hdl.handle.net/1903/3392

Not specified: Masters Thesis or Doctoral Dissertation

17. Martinez Sandoval, Leonardo Ignacio. Contributions en géométrie combinatoire : rayons du cercle circonscrit différentes, théorèmes géométriques de type Hall, théorèmes fractionnaires de type Turán, matroïdes chemin du réseau et transversales de Kneser : Explorations in combinatorial geometry : Distinct circumradii, geometric Hall-type theorems, fractional Turán-type theorems, lattice path matroids and Kneser transversals.

Degree: Docteur es, Mathématiques et modélisation, 2016, Montpellier; Universidad nacional autónoma (Mexico)

URL: http://www.theses.fr/2016MONTT277

► La géométrie combinatoire est une large et belle branche des mathématiques. Cette thèse doctorale se compose de l'étude de cinq sujets différents dans ce domaine.…
(more)

Subjects/Keywords: Géométrie combinatoire; Théorie des graphes; Théorème de Hall; Théorème de Turán; Matroïde; Transversal; Combinatorial geometry; Graph theory; Hall's theorem; Turán's theorem; Matroid; Transversal

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martinez Sandoval, L. I. (2016). Contributions en géométrie combinatoire : rayons du cercle circonscrit différentes, théorèmes géométriques de type Hall, théorèmes fractionnaires de type Turán, matroïdes chemin du réseau et transversales de Kneser : Explorations in combinatorial geometry : Distinct circumradii, geometric Hall-type theorems, fractional Turán-type theorems, lattice path matroids and Kneser transversals. (Doctoral Dissertation). Montpellier; Universidad nacional autónoma (Mexico). Retrieved from http://www.theses.fr/2016MONTT277

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

Martinez Sandoval, Leonardo Ignacio. “Contributions en géométrie combinatoire : rayons du cercle circonscrit différentes, théorèmes géométriques de type Hall, théorèmes fractionnaires de type Turán, matroïdes chemin du réseau et transversales de Kneser : Explorations in combinatorial geometry : Distinct circumradii, geometric Hall-type theorems, fractional Turán-type theorems, lattice path matroids and Kneser transversals.” 2016. Doctoral Dissertation, Montpellier; Universidad nacional autónoma (Mexico). Accessed December 05, 2020. http://www.theses.fr/2016MONTT277.

MLA Handbook (7^{th} Edition):

Martinez Sandoval, Leonardo Ignacio. “Contributions en géométrie combinatoire : rayons du cercle circonscrit différentes, théorèmes géométriques de type Hall, théorèmes fractionnaires de type Turán, matroïdes chemin du réseau et transversales de Kneser : Explorations in combinatorial geometry : Distinct circumradii, geometric Hall-type theorems, fractional Turán-type theorems, lattice path matroids and Kneser transversals.” 2016. Web. 05 Dec 2020.

Vancouver:

Martinez Sandoval LI. Contributions en géométrie combinatoire : rayons du cercle circonscrit différentes, théorèmes géométriques de type Hall, théorèmes fractionnaires de type Turán, matroïdes chemin du réseau et transversales de Kneser : Explorations in combinatorial geometry : Distinct circumradii, geometric Hall-type theorems, fractional Turán-type theorems, lattice path matroids and Kneser transversals. [Internet] [Doctoral dissertation]. Montpellier; Universidad nacional autónoma (Mexico); 2016. [cited 2020 Dec 05]. Available from: http://www.theses.fr/2016MONTT277.

Council of Science Editors:

Martinez Sandoval LI. Contributions en géométrie combinatoire : rayons du cercle circonscrit différentes, théorèmes géométriques de type Hall, théorèmes fractionnaires de type Turán, matroïdes chemin du réseau et transversales de Kneser : Explorations in combinatorial geometry : Distinct circumradii, geometric Hall-type theorems, fractional Turán-type theorems, lattice path matroids and Kneser transversals. [Doctoral Dissertation]. Montpellier; Universidad nacional autónoma (Mexico); 2016. Available from: http://www.theses.fr/2016MONTT277

18. Govindaraj, Santhosh. Calculation of sensor redundancy degree for linear sensor systems.

Degree: MS, Industrial Engineering, 2010, University of Iowa

URL: https://ir.uiowa.edu/etd/503

► The rapid developments in the sensor and its related technology have made automation possible in many processes in diverse fields. Also sensor-based fault diagnosis…
(more)

Subjects/Keywords: L1-Norm minimization; Linear Sensor System; Matroid Theory; Redundancy degree; Industrial Engineering

…for problems with special
sparse and clustered structures. They used the *matroid* *theory*, a… …provides background
information on *matroid* *theory* with standard definitions and axioms sufficient… …degree of sensor redundancy and a concept of *matroid* *theory* called (the
smallest)… …brief description about the graphical *matroid* and some applications of the
*matroid* *theory* are… …element to it will make it a dependent set. Such a set is called as Base under *matroid*
*theory*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Govindaraj, S. (2010). Calculation of sensor redundancy degree for linear sensor systems. (Masters Thesis). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/503

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

Govindaraj, Santhosh. “Calculation of sensor redundancy degree for linear sensor systems.” 2010. Masters Thesis, University of Iowa. Accessed December 05, 2020. https://ir.uiowa.edu/etd/503.

MLA Handbook (7^{th} Edition):

Govindaraj, Santhosh. “Calculation of sensor redundancy degree for linear sensor systems.” 2010. Web. 05 Dec 2020.

Vancouver:

Govindaraj S. Calculation of sensor redundancy degree for linear sensor systems. [Internet] [Masters thesis]. University of Iowa; 2010. [cited 2020 Dec 05]. Available from: https://ir.uiowa.edu/etd/503.

Council of Science Editors:

Govindaraj S. Calculation of sensor redundancy degree for linear sensor systems. [Masters Thesis]. University of Iowa; 2010. Available from: https://ir.uiowa.edu/etd/503

19. Braun, David. Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective : Combinatorial approach for the automation in Coq of formal proofs in incidence projective geometry.

Degree: Docteur es, Informatique, 2019, Université de Strasbourg

URL: http://www.theses.fr/2019STRAD020

►

Ce travail de thèse s’inscrit dans le domaine de la preuve assistée par ordinateur et se place d'un point de vue méthodologique. L’objectif premier des… (more)

Subjects/Keywords: Aide à la preuve; Automatisation; Assistant de preuve; Géométrie finie; Géométrie projective; Mécanisation des preuves; Propriété de Desargues; Prouveur automatique; Théorie des matroïdes; Automatic prover; Automation; Finite geometry; Proof assistance; Proof mechanization; Projective geometry; Proof assistant; Desargues's property; Matroid theory; SAT/SMT solvers; 005.4; 516.5

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Braun, D. (2019). Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective : Combinatorial approach for the automation in Coq of formal proofs in incidence projective geometry. (Doctoral Dissertation). Université de Strasbourg. Retrieved from http://www.theses.fr/2019STRAD020

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

Braun, David. “Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective : Combinatorial approach for the automation in Coq of formal proofs in incidence projective geometry.” 2019. Doctoral Dissertation, Université de Strasbourg. Accessed December 05, 2020. http://www.theses.fr/2019STRAD020.

MLA Handbook (7^{th} Edition):

Braun, David. “Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective : Combinatorial approach for the automation in Coq of formal proofs in incidence projective geometry.” 2019. Web. 05 Dec 2020.

Vancouver:

Braun D. Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective : Combinatorial approach for the automation in Coq of formal proofs in incidence projective geometry. [Internet] [Doctoral dissertation]. Université de Strasbourg; 2019. [cited 2020 Dec 05]. Available from: http://www.theses.fr/2019STRAD020.

Council of Science Editors:

Braun D. Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective : Combinatorial approach for the automation in Coq of formal proofs in incidence projective geometry. [Doctoral Dissertation]. Université de Strasbourg; 2019. Available from: http://www.theses.fr/2019STRAD020