• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 257
  • 120
  • 44
  • 43
  • 22
  • 10
  • 9
  • 7
  • 7
  • 5
  • 4
  • 4
  • 3
  • 3
  • 3
  • Tagged with
  • 597
  • 74
  • 49
  • 42
  • 41
  • 41
  • 40
  • 39
  • 38
  • 38
  • 37
  • 37
  • 36
  • 35
  • 35
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
91

Hessenberg Patch Ideals of Codimension 1

Atar, Busra January 2023 (has links)
A Hessenberg variety is a subvariety of the flag variety parametrized by two maps: a Hessenberg function on $[n]$ and a linear map on $\C^n$. We study regular nilpotent Hessenberg varieties in Lie type A by focusing on the Hessenberg function $h=(n-1,n,\ldots,n)$. We first state a formula for the $f^w_{n,1}$ which generates the local defining ideal $J_{w,h}$ for any $w\in\Ss_n$. Second, we prove that there exists a convenient monomial order so that $\lead(J_{w,h})$ is squarefree. As a consequence, we conclude that each codimension-1 regular nilpotent Hessenberg variety is locally Frobenius split (in positive characteristic). / Thesis / Master of Science (MSc)
92

Almost Regular Graphs And Edge Face Colorings Of Plane Graphs

Macon, Lisa 01 January 2009 (has links)
Regular graphs are graphs in which all vertices have the same degree. Many properties of these graphs are known. Such graphs play an important role in modeling network configurations where equipment limitations impose a restriction on the maximum number of links emanating from a node. These limitations do not enforce strict regularity, and it becomes interesting to investigate nonregular graphs that are in some sense close to regular. This dissertation explores a particular class of almost regular graphs in detail and defines generalizations on this class. A linear-time algorithm for the creation of arbitrarily large graphs of the discussed class is provided, and a polynomial-time algorithm for recognizing graphs in the class is given. Several invariants for the class are discussed. The edge-face chromatic number χef of a plane graph G is the minimum number of colors that must be assigned to the edges and faces of G such that no edge or face of G receives the same color as an edge or face with which it is incident or adjacent. A well-known result for the upper bound of χef exists for graphs with maximum degree Δ ≥ 10. We present a tight upper bound for plane graphs with Δ = 9.
93

Regular Sets, Scalar Multiplications and Abstractions of Distance Spaces

Drake, James Stanley 05 1900 (has links)
<p> This thesis is both classically and abstractly oriented in a geometrical sense. The discussion is centred around the motion distance.</p> <p> In the first chapter, the concept of a regular set is defined and discussed. The idea of a regular set is a natural generalization of equilateral triangles and regular tetrahedra in Euclidean spaces.</p> <p> In chapter two, two kinds of scalar multiplication associated with metric spaces are studied.</p> <p> In chapter three, the concept of distance is abstracted to a level where it loses most of its structure. This abstraction is then examined.</p> <p> In chapter four, generalized metric spaces are examined. These are specializations of the abstract spaces of chapter three.</p> / Thesis / Doctor of Philosophy (PhD)
94

An Introduction to Fröberg's Conjecture

Semmens, Caroline 01 June 2022 (has links) (PDF)
The goal of this thesis is to make Fröberg's conjecture more accessible to the average math graduate student by building up the necessary background material to understand specific examples where Fröberg's conjecture is true.
95

Learning to Teach Reading: A Comparison of Regular & Special Education Preservice Programs

Poulton, Ann Marie 22 February 2007 (has links)
No description available.
96

Performance and Security Mechanisms in Massive Scale Wireless Multi-hop Networks

Pandit, Vaibhav 23 May 2014 (has links)
No description available.
97

Growth of the ideal generated by a quadratic multivariate function

Kruglov, Victoria 03 December 2010 (has links)
No description available.
98

Proportional Fairness in Regular Topologies of Wireless Sensor Networks

Narayanan, Sriram 26 September 2011 (has links)
No description available.
99

Transmission of digital images using data-flow architecture

Haddad, Nicholas January 1985 (has links)
No description available.
100

L-factors of Supercuspidal Representations of p-adic GSp(4)

Danisman, Yusuf 21 July 2011 (has links)
No description available.

Page generated in 0.0553 seconds