To see the other types of publications on this topic, follow the link: Regularity.

Dissertations / Theses on the topic 'Regularity'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Regularity.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Imre, Voros. "Functional calculi and maximal regularity." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510255.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shawe-Taylor, John Stewart. "Regularity and transitivity in graphs." Thesis, Royal Holloway, University of London, 1985. http://repository.royalholloway.ac.uk/items/52cb738e-0daa-426a-afe1-b108678cccc4/1/.

Full text
Abstract:
Graphs with high regularity and transitivity conditions are studied. The first graphs considered are graphs where each vertex has an intersection array (possibly differing from that of other vertices). These graphs are called distance-regularised and are shown to be distance-regular or bipartite with each bipartition having the same intersection array. The latter graphs are called distance-biregular. This leads to the study of distance-biregular graphs. The derived graphs of a distance-biregular graph are shown to be distance-regular and the notion of feasibility for a distance-regular graph is extended to the biregular case. The study of the intersection arrays of distance-biregular graphs is concluded with a bound on the diameter in terms of the girth and valencies. Special classes of distance-biregular graphs are also studied. Distance-biregular graphs with 2-valent vertices are shown to be the subdivision graphs of cages. Distance-biregular graphs with one derived graph complete and the other strongly-regular are characterised according to the minimum eigenvalue of the strongly-regular graph. Distance-biregular graphs with prescribed derived graph are classified in cases where the derived graph is from some classes of classical distance-regular graphs. A graph theoretic proof of part of the Praeger, Saxl and Yokoyama theorem is given. Finally imprimitivity in distance-biregular graphs is studied and the Praeger, Saxl and Yokoyama theorem is used to show that primitive non-regular distance-bitransitive graphs have almost simple automorphism groups. Many examples of distance-biregular and distance-bitransitive graphs are given.
APA, Harvard, Vancouver, ISO, and other styles
3

Fang, Yangqin. "Minimal sets, existence and regularity." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112191/document.

Full text
Abstract:
Cette thèse s’intéresse principalement à l’existence et à la régularité desensembles minimaux. On commence par montrer, dans le chapitre 3, que le problème de Plateau étudié par Reifenberg admet au moins une solution. C’est-à-dire que, si l’onse donne un ensemble compact B⊂R^n et un sous-groupe L du groupe d’homologie de Čech H_(d-1) (B;G) de dimension (d-1) sur un groupe abelien G, on montre qu’il existe un ensemble compact E⊃B tel que L est contenu dans le noyau de l’homomorphisme H_(d-1) (B;G)→H_(d-1) (E;G) induit par l’application d’inclusion B→E, et pour lequel la mesure de Hausdorff H^d (E∖B) est minimale (sous ces contraintes). Ensuite, on montre au chapitre 4, que pour tout ensemble presque minimal glissant E de dimension 2, dans un domaine régulier Σ ressemblant localement à un demi espace, associé à la frontière glissante ∂Σ, et tel que E⊃∂Σ, il se trouve qu’à la frontière E est localement équivalent, par un homéomorphisme biHöldérien qui préserve la frontière, à un cône minimal glissant contenu dans un demi plan Ω, avec frontière glissante ∂Ω. De plus les seuls cônes minimaux possibles dans ce cas sont ∂Ω seul, ou son union avec un cône de type P_+ ou Y_+
This thesis focuses on the existence and regularity of minimal sets. First we show, in Chapter 3, that there exists (at least) a minimizerfor Reifenberg Plateau problems. That is, Given a compact set B⊂R^n, and a subgroup L of the Čech homology group H_(d-1) (B;G) of dimension (d-1)over an abelian group G, we will show that there exists a compact set E⊃B such that L is contained in the kernel of the homomorphism H_(d-1) (B;G)→H_(d-1) (E;G) induced by the natural inclusion map B→E, and such that the Hausdorff measure H^d (E∖B) is minimal under these constraints. Next we will show, in Chapter 4, that if E is a sliding almost minimal set of dimension 2, in a smooth domain Σ that looks locally like a half space, and with sliding boundary , and if in addition E⊃∂Σ, then, near every point of the boundary ∂Σ, E is locally biHölder equivalent to a sliding minimal cone (in a half space Ω, and with sliding boundary ∂Ω). In addition the only possible sliding minimal cones in this case are ∂Ω or the union of ∂Ω with a cone of type P_+ or Y_+
APA, Harvard, Vancouver, ISO, and other styles
4

Döller, Christian. "The neural bases of regularity learning /." Saarbrücken, 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=974108200.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pons, Solé Marc. "Layout regularity for design and manufacturability." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/96983.

Full text
Abstract:
In nowadays nanometer technology nodes, the semiconductor industry has to deal with the new challenges associated to technology scaling. On one hand, process developers face increasing manufacturing cost and variability, but also decreasing manufacturing yield. On the other hand, circuit designers and electronic design automation (EDA) developers have to reduce design turnaround time and provide the tools to cope with increasing design complexity and reduce the time-to-market. In this scenario, closer collaboration between all the actors involved is required. New approaches considering both design and manufacturing need to be explored. These are the so called design for manufacturability (DFM) techniques. A DFM trend that is becoming dominant is to make circuit layouts more regular and repetitive. The regular layout fabrics are based on the configuration of a simplied mask set, therefore reducing the manufacturing cost. Moreover, a reduced number of layout patterns is used, allowing better process variability control and optimization. Hence, regularity reduces layout complexity and therefore design complexity, allowing faster time-to-market. In this thesis, we explore forcing maximum layout regularity focusing on future technology nodes, with increasing design and manufacturability issues, where we expect layout regularity to be mandatory. With this objective, we have developed a new regular layout fabric called Via-Configurable Transistor Array (VCTA). The physical design is fully explained involving layout and geometrical considerations for transistors and interconnects. Initially, VCTA layouts developed manually have been evaluated in terms of manufacturability, but also in terms of area, energy and delay. For digital design, 32-bit binary adders designed with VCTA have been compared to standard cell layouts. For analog design, a delay-locked loop design using VCTA has been compared to its full custom version. We have also developed a physical synthesis tool that allows us to obtain VCTA circuit layouts in an automated way. Developing our own automation tool lets us controlling all the decisions made during the physical design flow to ensure that maximum layout regularity is respected. In this case the work is based on several algorithms, for instance for routing, that we have oriented to the area optimization of the layouts. Finally, in order to demonstrate the benefits of layout regularity, we have proposed a new layout regularity metric called Fixed Origin Corner Square Inspection (FOCSI). It is based on the geometrical inspection of the patterns in the layouts and it allows designers to compare regularity of designs but also how their regularity will impact their manufacturability. The FOCSI layout analysis tool can be used to optimize manufacturability.
APA, Harvard, Vancouver, ISO, and other styles
6

Ouhnana, Marouane. "Visual after-effect of perceived regularity." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=110475.

Full text
Abstract:
Aim: Regular repeating patterns are prominent features in a visual scene. Here I consider whether regularity is an adaptable feature that produces a subsequent after-effect and whether a first- or second-order process mediates that after-effect. Method: Stimuli consisted of a 7 by 7 arrangement of elements on a baseline grid. The position of each element was randomly jittered from its baseline position by an amount that determined its degree of pattern irregularity. The elements of the pattern consisted of dark Gaussian blobs (GB), difference of Gaussians (DOG) or random binary patterns (RBP). Observers adapted for 60 seconds to a pair of patterns above and below fixation with a different degree of regularity, then adjusted the relative degree of regularity of two subsequently presented test patterns. The size of the after-effect at the point of subjective equality (PSE) was given by the baseline removed difference in regularity at the PSE or log ratio of the physical element jitter of the two test patterns at the PSE. Results: PSEs revealed that regularity is an adaptable feature that produces a unidirectional after-effect; specifically that adaptation only causes test patterns to appear less regular. The after-effect displayed transfer from GB adaptors to both DOG and RB test patterns and from DOG and (RBP) adaptors to GB patterns. Conclusion: Pattern regularity is an adaptable feature in vision, which produces a novel unidirectional after-effect I have termed Regularity After-Effect, or RAE. I propose second-order spatial-frequency channels as candidate mechanisms of regularity processing.
Objectif: Les motifs réguliers répétitifs sont des caractéristiques de premier plan dans la scène visuelle. Cette communication a comme objectif de découvrir si la régularité est une caractéristique adaptable du système visuel produisant un effet consécutif et si cet effet-consécutif est lié à un processus de premier- ou de second-ordre. Méthode: Les stimuli étaient constitués en un arrangement 7 par 7 éléments sur une grille. La position de chaque élément a été giguer au hasard à partir de sa position d'origine avec une valeur qui détermine son degré d'irrégularité. Les éléments qui constituent chaque grille pouvaient être des blobs de Gaussiennes (GB), des différence de Gaussiennes (DOG) ou de motif binaire aléatoire (RBP). Les participants ont été adaptés pour 60 secondes à une paire de motifs placée de part et d'autre d'un point de fixation ou chaque motif avait un degré différent de régularité. Les participants devaient ajuster le degré relatif de régularité de deux motifs présentés après. La taille de l'effet-consécutif est obtenue par la différence de régularité au point subjectif d'égalité soustrait à la régularité mesurée entre les deux motifs test ou par le logarithme du ratio de la différence de régularité entre les deux motifs test au point subjectif d'égalité. Résultats: Les point-subjectif d'égalité mesurée ont montrées que la régularité est une caractéristique adaptable qui produit un effet-consécutif unidirectionnel, plus précisément que les motifs sont perçus comme plus irréguliers après adaptation. On a observe un transfert à partir des stimuli d'élément GB a des motifs de test RBP et DOG et un transfert a partir des stimuli DOG et RBP vers des test de GB. Conclusion: La régularité est un élément du système visuel adaptable, produisant effet-consécutif unidirectionnel nouveau que appelé l'effet consécutif de la régularité. Je propose les canaux de fréquence-spatial de second-ordre comme mécanisme candidat au traitement de la régularité.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhao, Yufei. "Sparse regularity and relative Szemerédi theorems." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99060.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 171-179).
We extend various fundamental combinatorial theorems and techniques from the dense setting to the sparse setting. First, we consider Szemerédi regularity lemma, a fundamental tool in extremal combinatorics. The regularity method, in its original form, is effective only for dense graphs. It has been a long standing problem to extend the regularity method to sparse graphs. We solve this problem by proving a so-called "counting lemma," thereby allowing us to apply the regularity method to relatively dense subgraphs of sparse pseudorandom graphs. Next, by extending these ideas to hypergraphs, we obtain a simplification and extension of the key technical ingredient in the proof of the celebrated Green-Tao theorem, which states that there are arbitrarily long arithmetic progressions in the primes. The key step, known as a relative Szemerédi theorem, says that any positive proportion subset of a pseudorandom set of integers contains long arithmetic progressions. We give a simple proof of a strengthening of the relative Szemerédi theorem, showing that a much weaker pseudorandomness condition is sufficient. Finally, we give a short simple proof of a multidimensional Szemerédi theorem in the primes, which states that any positive proportion subset of Pd (where P denotes the primes) contains constellations of any given shape. This has been conjectured by Tao and recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler.
by Yufei Zhao.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Onwunta, Akwum A. "On the regularity of refinable functions." Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/2881.

Full text
Abstract:
Thesis (MSc (Mathematical Sciences. Physical and Mathematical Analysis))--University of Stellenbosch, 2006.
This work studies the regularity (or smoothness) of continuous finitely supported refinable functions which are mainly encountered in multiresolution analysis, iterative interpolation processes, signal analysis, etc. Here, we present various kinds of sufficient conditions on a given mask to guarantee the regularity class of the corresponding refinable function. First, we introduce and analyze the cardinal B-splines Nm, m ∈ N. In particular, we show that these functions are refinable and belong to the smoothness class Cm−2(R). As a generalization of the cardinal B-splines, we proceed to discuss refinable functions with positive mask coefficients. A standard result on the existence of a refinable function in the case of positive masks is quoted. Following [13], we extend the regularity result in [25], and we provide an example which illustrates the fact that the associated symbol to a given positive mask need not be a Hurwitz polynomial for its corresponding refinable function to be in a specified smoothness class. Furthermore, we apply our regularity result to an integral equation. An important tool for our work is Fourier analysis, from which we state some standard results and give the proof of a non-standard result. Next, we study the H¨older regularity of refinable functions, whose associated mask coefficients are not necessarily positive, by estimating the rate of decay of their Fourier transforms. After showing the embedding of certain Sobolev spaces into a H¨older regularity space, we proceed to discuss sufficient conditions for a given refinable function to be in such a H¨older space. We specifically express the minimum H¨older regularity of refinable functions as a function of the spectral radius of an associated transfer operator acting on a finite dimensional space of trigonometric polynomials. We apply our Fourier-based regularity results to the Daubechies and Dubuc-Deslauriers refinable functions, as well as to a one-parameter family of refinable functions, and then compare our regularity estimates with those obtained by means of a subdivision-based result from [28]. Moreover, we provide graphical examples to illustrate the theory developed.
APA, Harvard, Vancouver, ISO, and other styles
9

Barber, Ben. "Partition regularity and other combinatorial problems." Thesis, University of Cambridge, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.648544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Aleksanyan, Gohar. "Regularity results in free boundary problems." Doctoral thesis, KTH, Matematik (Avd.), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-195178.

Full text
Abstract:
This thesis consists of three scientific papers, devoted to the regu-larity theory of free boundary problems. We use iteration arguments to derive the optimal regularity in the optimal switching problem, and to analyse the regularity of the free boundary in the biharmonic obstacle problem and in the double obstacle problem.In Paper A, we study the interior regularity of the solution to the optimal switching problem. We derive the optimal C1,1-regularity of the minimal solution under the assumption that the zero loop set is the closure of its interior.In Paper B, assuming that the solution to the biharmonic obstacle problem with a zero obstacle is suÿciently close-to the one-dimensional solution (xn)3+, we derive the C1,-regularity of the free boundary, under an additional assumption that the noncoincidence set is an NTA-domain.In Paper C we study the two-dimensional double obstacle problem with polynomial obstacles p1 p2, and observe that there is a new type of blow-ups that we call double-cone solutions. We investigate the existence of double-cone solutions depending on the coeÿcients of p1, p2, and show that if the solution to the double obstacle problem with obstacles p1 = −|x|2 and p2 = |x|2 is close to a double-cone solution, then the free boundary is a union of four C1,-graphs, pairwise crossing at the origin.

QC 20161103

APA, Harvard, Vancouver, ISO, and other styles
11

Jaeger, Mitchell Smith Michel. "A study of regularity and normality." Auburn, Ala, 2009. http://hdl.handle.net/10415/1638.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Tonon, Daniela. "Regularity results for Hamilton-Jacobi equations." Doctoral thesis, SISSA, 2011. http://hdl.handle.net/20.500.11767/4210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Zürcher, Thomas Zürcher Thomas. "Hausdorff dimension and regularity of Sobolev functions /." [S.l.] : [s.n.], 2009. http://www.ub.unibe.ch/content/bibliotheken_sammlungen/sondersammlungen/dissen_bestellformular/index_ger.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Lahiri, Ananda [Verfasser]. "Regularity of the Brakke Flow / Ananda Lahiri." Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1054951012/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Fan, Hongliang. "The impact of mesh regularity on errors." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/60771.

Full text
Abstract:
Mesh quality plays an important role in improving the accuracy of the numerical simulation. There are different quality metrics for specific numerical cases. A regular mesh consisting of the equilateral triangles is one of them and is expected to improve the error performance. In this study, Engwirda’s frontal-Delaunay scheme and Marcum’s advancing front local reconnection scheme are described along with the conventional Delaunay triangulation. They are shown to improve the mesh regularity effectively. Even though several numerical test cases show that more regular meshes barely improve the error performance, the time cost in the solver of regular meshes is smaller than the Delaunay mesh. The time cost decrease in the solver pays off the additional cost in the mesh generation stage. For simple test cases, more regular meshes obtain lower errors than conventional Delaunay meshes with similar time costs. For more complicated cases, the improvement in errors is small but regular meshes can save time, especially for a high order solver. Generally speaking, a regular mesh does not improve the error performance as much as we expect, but it is worth generating.
Applied Science, Faculty of
Mechanical Engineering, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
16

Schwarzacher, Sebastian. "Regularity for degenerate elliptic and parabolic systems." Diss., Ludwig-Maximilians-Universität München, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:19-162092.

Full text
Abstract:
In this work local behavior for solutions to the inhomogeneous p-Laplace in divergence form and its parabolic version are studied. It is parabolic and non-linear generalization of the Calderon-Zygmund theory for the Laplace operator. I.e. the borderline case BMO is studied. The two main results are local BMO and Hoelder estimates for the inhomogenious p-Laplace and the parabolic p-Laplace system. An adaption of some estimates to fluid mechanics, namely on the p-Stokes equation are also proven. The p-Stokes system is a very important physical model for so-called non Newtonian fluids (e.g. blood). For this system BMO and Hoelder estimates are proven in the stationary 2-dimensional case.
APA, Harvard, Vancouver, ISO, and other styles
17

Schechter, Alexander. "Regularity and other properties of Hausdorff measures." Thesis, University College London (University of London), 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Roberts, James. "A regularity theory for Fractional Harmonic Maps." Thesis, University of Bath, 2017. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760897.

Full text
Abstract:
Our purpose is to define, and develop a regularity theory for, Intrinsic Minimising Fractional Harmonic Maps from Euclidean space into smooth compact Riemannian manifolds for fractional powers strictly between zero and one. Our aims are motivated by the theory for Intrinsic Semi-Harmonic Maps, corresponding to the power one-half, developed by Moser. Our definition and methodology are based on an extension method used for the analysis of real valued fractional harmonic functions. We define and derive regularity properties of Fractional Harmonic Maps by regarding their domain as part of the boundary of a half-space, equipped with a Riemannian metric which degenerates or becomes singular on the boundary, and considering the regularity of their extensions to this half-space. We show that Fractional Harmonic Maps, and their first order derivatives, are locally Hölder continuous away from a set with Hausdorff dimension depending on the dimension of the domain and the fractional power in question. We achieve this by establishing the corresponding partial regularity of extensions of Fractional Harmonic Maps which minimise the Dirichlet energy on the half-space. To prove local Hölder continuity, we develop several results in the spirit of the regularity theory for harmonic maps. We combine a monotonicity formula with the construction of comparison maps, scaling in the Poincaré inequality and results from the theory of harmonic maps, to prove energy decay sufficient for the application of a modified decay lemma of Morrey. Using the Hölder continuity of minimisers, we prove a bound for the essential supremum of their gradient. Then we consider the derivatives in directions tangential to the boundary of the half-space; we establish the existence of their gradients using difference quotients. A Caccioppoli-type inequality and scaling in the Poincaré inequality then imply decay estimates sufficient for the application of the modified decay lemma to these derivatives.
APA, Harvard, Vancouver, ISO, and other styles
19

Locatelli, Acyr. "On the regularity of cylindrical algebraic decompositions." Thesis, University of Bath, 2016. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687305.

Full text
Abstract:
Cylindrical algebraic decomposition is a powerful algorithmic technique in semi-algebraic geometry. Nevertheless, there is a disparity between what algorithms output and what the abstract definition of a cylindrical algebraic decomposition allows. Some work has been done in trying to understand what the ideal class of cylindrical algebraic decom- positions should be — especially from a topological point of view. We prove a special case of a conjecture proposed by Lazard in [22]; the conjecture relates a special class of cylindrical algebraic decompositions to regular cell complexes. Moreover, we study the properties that define this special class of cell decompositions, as well as their implications for the actual topology of the cells that make up the cell decompositions.
APA, Harvard, Vancouver, ISO, and other styles
20

Lovász, László Miklós. "Regularity and removal lemmas and their applications." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112899.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 123-127).
In this thesis, we analyze the regularity method pioneered by Szemerédi, and also discuss one of its prevalent applications, the removal lemma. First, we prove a new lower bound on the number of parts required in a version of Szemerédi's regularity lemma, determining the order of the tower height in that version up to a constant factor. This addresses a question of Gowers. Next, we turn to algorithms. We give a fast algorithmic Frieze-Kannan (weak) regularity lemma that improves on previous running times. We use this to give a substantially faster deterministic approximation algorithm for counting subgraphs. Previously, only an exponential dependence of the running time on the error parameter was known; we improve it to a polynomial dependence. We also revisit the problem of finding an algorithmic regularity lemma, giving approximation algorithms for some co-NP-complete problems. We show how to use the Frieze-Kannan regularity lemma to approximate the regularity of a pair of vertex sets. We also show how to quickly find, for each [epsilon]' > [epsilon], an [epsilon]'-regular partition with k parts if there exists an [epsilon]-regular partition with k parts. After studying algorithms, we turn to the arithmetic setting. Green proved an arithmetic regularity lemma, and used it to prove an arithmetic removal lemma. The bounds obtained, however, were tower-type, and Green posed the problem of improving the quantitative bounds on the arithmetic triangle removal lemma, and, in particular, asked whether a polynomial bound holds. The previous best known bound was tower-type with a logarithmic tower height. We solve Green's problem, proving an essentially tight bound for Green's arithmetic triangle removal lemma in Fn/p. Finally, we give a new proof of a regularity lemma for permutations, improving the previous tower-type bound on the number of parts to an exponential bound.
by László Miklós Lovász.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
21

Russell, Paul Alexander. "Sparse partition regularity and other combinatorial results." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615234.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Gibbeson, Dominic. "Low regularity solutions of nonlinear wave equations." Thesis, University of Edinburgh, 2004. http://hdl.handle.net/1842/14900.

Full text
Abstract:
We investigate solutions of the coupled Diral Klein-Gordon Equations in one and three space dimensions. Through analysis of the Fourier representations of the solutions to these equations, we introduce the ‘Null Structure’ as developed by Klainerman and Machedon. This structure allows us to prove the necessary estimates, both fixed time and bilinear space-time, that allow us to show existence of solutions of these equations with initial data of lower regularity than previously required. We also study global existence for a two dimensional wave equation with a critical non-linearity.
APA, Harvard, Vancouver, ISO, and other styles
23

Prazeres, Disson Soares dos. "Improved regularity estimates in nonlinear elliptic equations." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=13536.

Full text
Abstract:
CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico
In this work we establish local regularity estimates for at solutions to non-convex fully nonlinear elliptic equations and we study cavitation type equations modeled within coef- icients bounded and measurable.
Neste trabalho estabelecemos estimativas de regularidade local para soluÃÃes "flat" de equaÃÃes elÃpticas totalmente nÃo-lineares nÃo-convexas e estudamos equations do tipo cavidade com coeficientes meramente mensurÃveis.
APA, Harvard, Vancouver, ISO, and other styles
24

Gmeineder, Franz Xaver. "Regularity theory for variational problems on BD." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:1f412087-de70-44a8-a045-8923f1e29611.

Full text
Abstract:
In this thesis we provide regularity results for convex and semiconvex variational problems which are of linear growth and depend on the symmetric rather than the full gradient. By the non-availability of Korn's Inequality (known as Ornstein's Non-Inequality), usual approaches need to be modified in order to obtain higher regularity of generalised minima.
APA, Harvard, Vancouver, ISO, and other styles
25

Silva, Anabela de Sousa e. "Regularity of Wiener-Hopf plus Hankel operators." Doctoral thesis, Universidade de Aveiro, 2011. http://hdl.handle.net/10773/7936.

Full text
Abstract:
Doutoramento em Matemática
In this thesis we consider Wiener-Hopf-Hankel operators with Fourier symbols in the class of almost periodic, semi-almost periodic and piecewise almost periodic functions. In the first place, we consider Wiener-Hopf-Hankel operators acting between L2 Lebesgue spaces with possibly different Fourier matrix symbols in the Wiener-Hopf and in the Hankel operators. In the second place, we consider these operators with equal Fourier symbols and acting between weighted Lebesgue spaces Lp(R;w), where 1 < p < 1 and w belongs to a subclass of Muckenhoupt weights. In addition, singular integral operators with Carleman shift and almost periodic coefficients are also object of study. The main purpose of this thesis is to obtain regularity properties characterizations of those classes of operators. By regularity properties we mean those that depend on the kernel and cokernel of the operator. The main techniques used are the equivalence relations between operators and the factorization theory. An invertibility characterization for the Wiener-Hopf-Hankel operators with symbols belonging to the Wiener subclass of almost periodic functions APW is obtained, assuming that a particular matrix function admits a numerical range bounded away from zero and based on the values of a certain mean motion. For Wiener-Hopf-Hankel operators acting between L2-spaces and with possibly different AP symbols, criteria for the semi-Fredholm property and for one-sided and both-sided invertibility are obtained and the inverses for all possible cases are exhibited. For such results, a new type of AP factorization is introduced. Singular integral operators with Carleman shift and scalar almost periodic coefficients are also studied. Considering an auxiliar and simpler operator, and using appropriate factorizations, the dimensions of the kernels and cokernels of those operators are obtained. For Wiener-Hopf-Hankel operators with (possibly different) SAP and PAP matrix symbols and acting between L2-spaces, criteria for the Fredholm property are presented as well as the sum of the Fredholm indices of the Wiener-Hopf plus Hankel and Wiener-Hopf minus Hankel operators. By studying dependencies between different matrix Fourier symbols of Wiener-Hopf plus Hankel operators acting between L2-spaces, results about the kernel and cokernel of those operators are derived. For Wiener-Hopf-Hankel operators acting between weighted Lebesgue spaces, Lp(R;w), a study is made considering equal scalar Fourier symbols in the Wiener-Hopf and in the Hankel operators and belonging to the classes of APp;w, SAPp;w and PAPp;w. It is obtained an invertibility characterization for Wiener-Hopf plus Hankel operators with APp;w symbols. In the cases for which the Fourier symbols of the operators belong to SAPp;w and PAPp;w, it is obtained semi-Fredholm criteria for Wiener-Hopf-Hankel operators as well as formulas for the Fredholm indices of those operators.
Nesta tese consideramos operadores de Wiener-Hopf-Hankel com símbolos de Fourier nas classes das funções quase-periódicas, semi-quase periódicas e quase periódicas por troços. Começamos por considerar operadores de Wiener-Hopf-Hankel actuando entre espaços de Lebesgue L2 com símbolos matriciais de Fourier possivelmente diferentes nos operadores de Wiener- Hopf e de Hankel. Seguidamente, consideramos estes operadores com símbolos de Fourier iguais actuando entre espaços de Lebesgue com pesos Lp(R;w), onde 1 < p < 1 e w pertence a uma subclasse de pesos de Muckenhoupt. Adicionalmente, são também objecto de estudo operadores singulares integrais com deslocamento de Carleman e coeficientes quaseperiódicos. O objectivo principal desta tese é obter caracterizações para tais classes de operadores no que refere às suas propriedades de regularidade. Por propriedades de regularidade nós designamos aquelas propriedades que dependem do núcleo e do co-núcleo do operador. As principais técnicas usadas são as relações de equivalência entre operadores e a teoria da factorização. Uma caracterização da invertibilidade de operadores de Wiener-Hopf-Hankel com símbolos pertencentes à subclasse de Wiener de funções quaseperiódicas APW é obtida, assumindo que uma particular função matricial admite um contradomínio numérico limitado fora de zero e baseando-nos nos valores uma certa média de deslocamento. Para os operadores de Wiener-Hopf-Hankel actuando entre espaços de Lebesgue L2 e com símbolos AP possivelmente diferentes, critérios para a propriedade de semi-Fredholm e para a invertibilidade lateral e bi-lateral são obtidos e inversos para todos os casos possíveis são apresentados. Com vista a tais resultados, um novo tipo de factorização AP é introduzido. Operadores singulares integrais com deslocamento de Carleman e com coeficientes escalares quase-periódicos são também estudados. Considerando um operador auxiliar mais simples e usando factorizações apropriadas, as dimensões dos núcleos e dos co-núcleos destes operadores são obtidas. Para operadores de Wiener-Hopf-Hankel com símbolos matriciais SAP e PAP (possivelmente diferentes) actuando entre espaços de Lebesgue L2, critérios para a propriedade de Fredholm são apresentados tal como a soma dos índices de Fredholm dos operadores de Wiener-Hopf mais Hankel e Wiener-Hopf menos Hankel. Estudando dependências entre diferentes símbolos matriciais de Fourier dos operadores de Wiener-Hopf mais Hankel actuando entre espaços de Lebesgue L2, conclusões são obtidas acerca do núcleo e do co-núcleo destes operadores. Para operadores de Wiener-Hopf-Hankel actuando entre espaços de Lebesgue com pesos, Lp(R;w), é feito um estudo considerando símbolos de Fourier escalares e iguais nos operadores de Wiener-Hopf e de Hankel e pertencentes às classes APp;w, SAPp;w e PAPp;w. É obtida uma caracterização da invertibilidade para operadores de Wiener-Hopf mais Hankel com símbolos APp;w. No caso em que os símbolos de Fourier dos operadores pertencem a SAPp;w e PAPp;w, são obtidos critérios de semi-Fredholm para os operadores de Wiener-Hopf-Hankel assim como fórmulas para os índices de Fredholm de tais operadores.
APA, Harvard, Vancouver, ISO, and other styles
26

Gutekunst, Todd M. "Subsets of finite groups exhibiting additive regularity." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 128 p, 2008. http://proquest.umi.com/pqdweb?did=1605136271&sid=5&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Khan, Shoaib Amjad. "A hypergraph regularity method for linear hypergraphs." [Tampa, Fla] : University of South Florida, 2009. http://purl.fcla.edu/usf/dc/et/SFE0003001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Achache, Mahdi. "Maximal regularity for non-autonomous evolution equations." Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0026/document.

Full text
Abstract:
Cette thèse est dédiée a l''etude de certaines propriétés des équations d' évolutions non-autonomes $u'(t)+A(t)u(t)=f(t), u(0)=x.$ Il s'agit précisément de la propriété de la régularité maximale $L^p$: étant donnée $fin L^{p}(0,tau;H)$, montrer l'existence et unicité de la solution $u in W^{1,p}(0,tau;H)$. Ce problème a 'et'e intensivement étudie dans le cas autonome, i.e., $A(t)=A$ pour tout $t$. Dans le cas non-autonome, le problème a été considéré par J.L.Lions en 1960. Nous montrons divers résultats qui étendent tout ce qui est connu sur ce problème. On suppose ici que la famille des opérateurs $(mathcal{A}(t))_{tin [0,tau]}$ est associée à des formes quasi-coercives, non autonomes $(fra(t))_{t in [0,tau]}.$ Nous considérons également le problème de régularité maximale pour les d'ordre 2 (équations des ondes). Plusieurs exemples et applications sont considérés
This Thesis is devoted to certain properties of non-autonomous evolution equations $u'(t)+A(t)u(t)=f(t), u(0)=x.$ More precisely, we are interested in the maximal $L^p$-regularity: given $fin L^{p}(0,tau;H),$ prove existence and uniqueness of the solution $u in W^{1,p}(0,tau;H)$. This problem was intensively studied in the autonomous cas, i.e., $A(t)=A$ for all $t.$ In the non-autonomous cas, the problem was considered by J.L.Lions in 1960. We prove serval results which extend all previously known ones on this problem. Here we assume that the familly of the operators $(mathcal{A}(t))_{tin [0,tau]}$ is associated with quasi-coercive, non-autonomous forms $(fra(t))_{t in [0,tau]}.$ We also consider the problem of maximal regularity for second order equations (the wave equation). Serval examples and applications are given in this Thesis
APA, Harvard, Vancouver, ISO, and other styles
29

Morley, Sam. "Regularity and extensions of Banach function algebras." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/43358/.

Full text
Abstract:
In this thesis we investigate the properties of various Banach function algebras and uniform algebras. We are particularly interested in regularity of Banach function algebras and extensions of uniform algebras. The first chapter contains the background in normed algebras, Banach function algebras, and uniform algebras which will be required throughout the thesis. In the second chapter we investigate the classicalisation of certain compact subsets of the complex plane obtained by deleting a sequence of open disks from a closed disk. Sets obtained in this manner are called Swiss cheese sets. We give a new topological proof of the Feinstein-Heath classicalisation theorem along with similar results. We conclude the chapter with an application of the classicalisation results. The results in this chapter are joint with H. Yang. In the third chapter we study Banach function algebras of functions satisfying a generalised notion of differentiability. These algebras were first investigated by Bland and Feinstein as a way to describe the completion of certain normed algebras of complex-differentiable functions. We prove a new version of chain rule in this setting, generalising a result of Chaobankoh, and use this chain rule to give a new proof of the quotient rule. We also investigate naturality and homomorphisms between these algebras. In the fourth chapter we continue the study of the notion of differentiability from the third chapter. We investigate a new notion of quasianalyticity in this setting and prove an analogue of the classical Denjoy-Carleman theorem. We describe those functions which satisfy a notion of analyticity, and give an application of these results. In the fifth chapter we investigate various methods for constructing extensions of uniform algebras. We study the structure of Cole extensions, introduced by Cole and later investigated by Dawson, relative to certain projections. We also discuss a larger class of extensions, which we call generalised Cole extensions, originally introduced by Cole and Feinstein. In the final chapter we investigate extensions of derivations from uniform algebras. We prove that there exists a non-trivial uniform algebra such that every derivation extends with the same norm to every generalised Cole extension of that algebra. A non-trivial, weakly amenable uniform algebra satisfies this property. We also investigate a sequence of extensions of a derivation from the disk algebra.
APA, Harvard, Vancouver, ISO, and other styles
30

Prazeres, Disson Soares dos. "Improved regularity estimates in nonlinear elliptic equations." reponame:Repositório Institucional da UFC, 2015. http://www.repositorio.ufc.br/handle/riufc/10721.

Full text
Abstract:
PRAZERES, Disson Soares dos. Improved regularity estimates in nonlinear elliptic equations. 2015. 48 f. Tese (doutorado) - Universidade Federal do Ceará, Centro de Ciências, Programa de Pós-Graduação em Matemática, Fortaleza-Ce, 2015
Submitted by Erivan Almeida (eneiro@bol.com.br) on 2015-02-20T18:39:02Z No. of bitstreams: 1 2015_tese_dsprazeres.pdf: 668497 bytes, checksum: 1381a344085631ce308230f7eb4221d6 (MD5)
Approved for entry into archive by Rocilda Sales(rocilda@ufc.br) on 2015-02-23T17:24:29Z (GMT) No. of bitstreams: 1 2015_tese_dsprazeres.pdf: 668497 bytes, checksum: 1381a344085631ce308230f7eb4221d6 (MD5)
Made available in DSpace on 2015-02-23T17:24:29Z (GMT). No. of bitstreams: 1 2015_tese_dsprazeres.pdf: 668497 bytes, checksum: 1381a344085631ce308230f7eb4221d6 (MD5) Previous issue date: 2015
In this work we establish local regularity estimates for at solutions to non-convex fully nonlinear elliptic equations and we study cavitation type equations modeled within coef- cients bounded and measurable.
Neste trabalho estabelecemos estimativas de regularidade local para soluções "flat" de equações elípticas totalmente não-lineares não-convexas e estudamos equations do tipo cavidade com coeficientes meramente mensuráveis.
APA, Harvard, Vancouver, ISO, and other styles
31

De, Philippis Guido. "Regularity of optimal transport maps and applications." Doctoral thesis, Scuola Normale Superiore, 2012. http://hdl.handle.net/11384/85688.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

JAFARI, SEPEHR. "Regularity of Powers and Products of Ideals." Doctoral thesis, Università degli studi di Genova, 2018. http://hdl.handle.net/11567/933556.

Full text
Abstract:
The aim of this thesis is to study the Castelnuovo-Mumford regularity of powers and products of ideals of polynomial rings. In general, it is known that the regularity of large enough powers of ideals are given by a linear function. Moreover, similar result holds for products of large enough powers of ideals which are generated in the same degrees. These are fascinating results, however, there are still missing mysteries on specics of the asymptotic linear functions. For example, the stabilizing index (the smallest power for which the regularity is a linear function) and the so called constant (the constant term in the linear function) is unknown in general. We compute these two missing parts for two deferent classes of ideals using two deferent methods.
APA, Harvard, Vancouver, ISO, and other styles
33

Forcillo, Nicolò. "Free Boundary Regularity of Some Non-Homogeneous Problems." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/16392/.

Full text
Abstract:
In this work, we deal with the study of some free boundary problems governed by non-homogeneous equations. In particular, we are interested in the regularity of the free boundaries for solutions of one-phase problems associated with non-divergence elliptic operators with variable coefficients.
APA, Harvard, Vancouver, ISO, and other styles
34

Hamburger, Christoph. "Regularity of differential forms minimizing degenerate elliptic functionals." Bonn : [s.n.], 1989. http://catalog.hathitrust.org/api/volumes/oclc/20436844.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Ros, Xavier. "Integro-differential equations : regularity theory and Pohozaev identities." Doctoral thesis, Universitat Politècnica de Catalunya, 2014. http://hdl.handle.net/10803/279289.

Full text
Abstract:
The main topic of the thesis is the study of Elliptic PDEs. It is divided into three parts: (I) integro-differential equations, (II) stable solutions to reaction-diffusion problems, and (III) weighted isoperimetric and Sobolev inequalities. Integro-differential equations arise naturally in the study of stochastic processes with jumps, and are used in Finance, Physics, or Ecology. The most canonical example of integro-differential operator is the fractional Laplacian (the infinitesimal generator of the radially symmetric stable process). In the first Part of the thesis we find and prove the Pohozaev identity for such operator. We also obtain boundary regularity results for general integro-differential operators, as explained next. In the classical case of the Laplacian, the Pohozaev identity applies to any solution of linear or semilinear problems in bounded domains, and is a very important tool in the study of elliptic PDEs. Before our work, a Pohozaev identity for the fractional Laplacian was not known. It was not even known which form should it have, if any. In this thesis we find and establish such identity. Quite surprisingly, it involves a local boundary term, even though the operator is nonlocal. The proof of the identity requires fine boundary regularity properties of solutions, that we also establish here. Our boundary regularity results apply to fully nonlinear integro-differential equations, but they improve the best known ones even for linear ones. Our work in Part II concerns the regularity of local minimizers to some elliptic equations, a classical problem in the Calculus of Variations. More precisely, we study the regularity of stable solutions to reaction-diffusion problems in bounded domains. It is a long standing open problem to prove that all stable solutions are bounded, and thus regular, in dimensions n<10. In dimensions n>=10 there are examples of singular stable solutions. The question is still open in dimensions 4El tema principal de la tesi és l'estudi d'EDPs el·líptiques. La tesi està dividida en tres parts: (I) equacions integro-diferencials, (II) solucions estables de problemes de reacció-difusió, i (III) desigualtats isoperimètriques i de Sobolev amb pesos. Les equacions integro-differencials apareixen de manera natural en l'estudi de processos estocàstics amb salts (processos de Lévy), i s'utilitzen per modelitzar problemes en Finances, Física, o Ecologia. L'exemple més canònic d'operador integro-diferencial és el Laplacià fraccionari (el generador infinitesimal d'un procés estable i radialment simètric). A la Part I de la tesi trobem i demostrem la identitat de Pohozaev per aquest operador. També obtenim resultats de regularitat a la vora per operadors integro-diferencials més generals, tal com expliquem a continuació. En el cas clàssic del Laplacià, la identitat de Pohozaev s'aplica a qualsevol solució de problemes lineals o semilineals en dominis acotats, i és una eina molt important en l'estudi d'EDPs el·líptiques. Abans del nostre treball, no es coneixia cap identitat de Pohozaev pel Laplacià fraccionari. Ni tan sols es sabia quina forma hauria de tenir, en cas que existís. En aquesta tesi trobem i demostrem aquesta identitat. Sorprenentment, la identitat involucra un terma de vora local, tot i que l'operador és no-local. La demostració de la identitat requereix conèixer el comportament precís de les solucions a la vora, cosa que també obtenim aquí. Els nostres resultats de regularitat a la vora s'apliquen a equacions integro-diferencials completament no-lineals, però milloren els resultats anteriors fins i tot per a equacions lineals. A la Part II estudiem la regularitat dels minimitzants locals d'algunes equacions el·líptiques, un problema clàssic del Càlcul de Variacions. En concret, estudiem la regularitat de les solucions estables a problemes de reacció-difusió en dominis acotats. És un problema obert des de fa molts anys demostrar que totes les solucions estables són acotades (i per tant regulars) en dimensions n<10. En dimensions n>=10 hi ha exemples de solucions estables singulars. La questió encara està oberta en dimensions 4
APA, Harvard, Vancouver, ISO, and other styles
36

Temesgen, Achenef Tesfahun. "Regularity results for the Dirac-Klein-Gordon equations." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-5404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Lindgren, Erik. "Regularity properties of two-phase free boundary problems." Doctoral thesis, KTH, Matematik (Inst.), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-10336.

Full text
Abstract:
This thesis consists of four papers which are all related to the regularity properties of free boundary problems. The problems considered have in common that they have some sort of two-phase behaviour.In papers I-III we study the interior regularity of different two-phase free boundary problems. Paper I is mainly concerned with the regularity properties of the free boundary, while in papers II and III we devote our study to the regularity of the function, but as a by-product we obtain some partial regularity of the free boundary.The problem considered in paper IV has a somewhat different nature. Here we are interested in certain approximations of the obstacle problem. Two major differences are that we study regularity properties close to the fixed boundary and that the problem converges to a one-phase free boundary problem.
QC 20100728
APA, Harvard, Vancouver, ISO, and other styles
38

Hägglund, Jonas. "Szémeredi's regularity lemma and its applications in combinatorics." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-51333.

Full text
Abstract:
Szemerédi’s regularity lemma is a deep result in graph theory with applications in many different areas of mathematics. The lemma says that any graph can be approximated by the union of a bounded num- ber of random-like bipartite graphs and this can be used to extract the underlying structure of the graph. Recently it has been shown that there exists polynomial time algorithms that can make this ap- proximation. This survey gives a proof of the regularity lemma, shows some applications and discusses some algorithmic aspects.
APA, Harvard, Vancouver, ISO, and other styles
39

Lindner, Felix [Verfasser]. "Approximation and Regularity of Stochastic PDEs / Felix Lindner." Aachen : Shaker, 2011. http://d-nb.info/1071529021/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Mather, Kevin. "Regularity of minimal surfaces : a self-contained proof." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/52820.

Full text
Abstract:
In this thesis, a self-contained proof is given of the regularity of minimal surfaces via viscosity solutions, following the ideas of L.Caffarelli,X.Cabré [2], O.Savin[11][12], E.Giusti[7] and J.Roquejoffre[8], where we expand upon the ideas and give full details on the approach. Basically the proof of the program consists of four parts: 1) Density and measure estimates, 2) Viscosity solution methods of elliptic equations , 3) a geometric Harnack inequality and 4) iteration of the De Giorgi flatness result.
Science, Faculty of
Mathematics, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
41

Campos, Cordero Judith. "Regularity and uniqueness in the calculus of variations." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:81e69dac-5ba2-4dc3-85bc-5d9017286f13.

Full text
Abstract:
This thesis is about regularity and uniqueness of minimizers of integral functionals of the form F(u) := ∫Ω F(∇u(x)) dx; where F∈C2(RNn) is a strongly quasiconvex integrand with p-growth, Ω⊆RnRn is an open bounded domain and u∈W1,pg(Ω,RN) for some boundary datum g∈C1,α(‾Ω, RN). The first contribution of this work is a full regularity result, up to the boundary, for global minimizers of F provided that the boundary condition g satisfies that ΙΙ∇gΙΙLP < ε for some ε > 0 depending only on n;N, the parameters given by the strong quasiconvexity and p-growth conditions and, most importantly, on an arbitrary but fixed constant M > 0 for which we require that ΙΙ∇gΙΙO,α < M. Furthermore, when the domain Ω is star-shaped, we extend the regularity result to the case of W1,p-local minimizers. On the other hand, for the case of global minimizers we exploit the compactness provided by the aforementioned regularity result to establish the main contribution of this thesis: we prove that, under essentially the same smallness assumptions over the boundary condition g that we mentioned above, the minimizer of F in W1,pg is unique. This result appears in contrast to the non-uniqueness examples previously given by Spadaro [Spa09], for which the boundary conditions are required to be suitably large.
APA, Harvard, Vancouver, ISO, and other styles
42

Wilson, Jonathan Peter. "Regularity of axisymmetric space-times in general relativity." Thesis, University of Southampton, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243657.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Song, Fei. "Practical and theoretical applications of the Regularity Lemma." Digital WPI, 2013. https://digitalcommons.wpi.edu/etd-dissertations/144.

Full text
Abstract:
The Regularity Lemma of Szemeredi is a fundamental tool in extremal graph theory with a wide range of applications in theoretical computer science. Partly as a recognition of his work on the Regularity Lemma, Endre Szemeredi has won the Abel Prize in 2012 for his outstanding achievement. In this thesis we present both practical and theoretical applications of the Regularity Lemma. The practical applications are concerning the important problem of data clustering, the theoretical applications are concerning the monochromatic vertex partition problem. In spite of its numerous applications to establish theoretical results, the Regularity Lemma has a drawback that it requires the graphs under consideration to be astronomically large, thus limiting its practical utility. As stated by Gowers, it has been ``well beyond the realms of any practical applications', the existing applications have been theoretical, mathematical. In the first part of the thesis, we propose to change this and we propose some modifications to the constructive versions of the Regularity Lemma. While this affects the generality of the result, it also makes it more useful for much smaller graphs. We call this result the practical regularity partitioning algorithm and the resulting clustering technique Regularity Clustering. This is the first integrated attempt in order to make the Regularity Lemma applicable in practice. We present results on applying regularity clustering on a number of benchmark data-sets and compare the results with k-means clustering and spectral clustering. Finally we demonstrate its application in Educational Data Mining to improve the student performance prediction. In the second part of the thesis, we study the monochromatic vertex partition problem. To begin we briefly review some related topics and several proof techniques that are central to our results, including the greedy and absorbing procedures. We also review some of the current best results before presenting ours, where the Regularity Lemma has played a critical role. Before concluding we discuss some future research directions that appear particularly promising based on our work.
APA, Harvard, Vancouver, ISO, and other styles
44

Mycroft, Richard. "The regularity method in directed graphs and hypergraphs." Thesis, University of Birmingham, 2010. http://etheses.bham.ac.uk//id/eprint/1036/.

Full text
Abstract:
In recent years the regularity method has been used to tackle many embedding problems in extremal graph theory. This thesis demonstrates and develops three different techniques which can be used in conjunction with the regularity method to solve such problems. These methods enable us to prove an approximate version of the well-known Sumner’s universal tournament conjecture, first posed in 1971, which states that any tournament G on 2n − 2 vertices contains a copy of any directed tree T on n vertices. An analysis of the extremal cases then proves that Sumner’s universal tournament conjecture holds for any sufficiently large n. Our methods are also applied to the problem of obtaining hypergraph analogues of Dirac’s theorem. Indeed, we show that for any k \(\geqslant\) 3 and any 1 \(\leqslant\) \(\ell\) \(\leqslant\) k − 1 with k - \(\ell\)\(\nmid\)k, any k-uniform hypergraph on n vertices with minimum degree at least \(\frac{n}{\lceil k / (k - \ell) \rceil (k - \ell)}\) + o(n) contains a Hamilton \(\ell\)-cycle. This result confirms a conjecture of Han and Schacht, and is best possible up to the o(n) error term. Together with results of Rodl, Rucinski and Szemeredi, this result asymptotically determines the minimum degree which forces an \(\ell\)-cycle for any \(\ell\) with 1 \(\leqslant\)\(\ell\)\(\leqslant\) k − 1.
APA, Harvard, Vancouver, ISO, and other styles
45

Zanger, Daniel Zvi. "Regularity and boundary variations for the Neumann problem." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Hudson, Thomas. "Stability and regularity of defects in crystalline solids." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:48ab1e44-f81a-4de0-b380-6fb0411bf1a9.

Full text
Abstract:
This thesis is devoted to the mathematical analysis of models describing the energy of defects in crystalline solids via variational methods. The first part of this work studies a discrete model describing the energy of a point defect in a one dimensional chain of atoms. We derive an expansion of the ground state energy using Gamma-convergence, following previous work on similar models [BDMG99,BC07,SSZ11]. The main novelty here is an explicit characterisation of the first order limit as the solution of a variational problem in an infinite lattice. Analysing this variational problem, we prove a regularity result for the perturbation caused by the defect, and demonstrate the order of the next term in the expansion. The second main topic is a discrete model describing screw dislocations in body centred cubic crystals. We formulate an anti plane lattice model which describes the energy difference between deformations and, using the framework defined in [AO05], provide a kinematic description of the Burgers vector, which is a key geometric quantity used to describe dislocations. Apart from the anti plane restriction, this model is invariant under all the natural symmetries of the lattice and in particular allows for the creation and annihilation of dislocations. The energy difference formulation enables us to provide a clear definition of what it means to be a stable deformation. The main results of the analysis of this model are then first, a proof that deformations with unit net Burgers vector exist as globally stable states in an infinite body, and second, that deformations containing multiple screw dislocations exist as locally stable states in both infinite bodies and finite convex bodies. To prove the former result, we establish coercivity with respect to the elastic strain, and exploit a concentration compactness principle. In the latter case, we use a form of the inverse function theorem, proving careful estimates on the residual and stability of an ansatz which combines continuum linear elasticity theory with an atomistic core correction.
APA, Harvard, Vancouver, ISO, and other styles
47

Hassanzadeh, Seyed Hamid. "Castelnuovo-Mumford regularity of residual interactions and liaison." Paris 6, 2009. http://www.theses.fr/2009PA066590.

Full text
Abstract:
Dans ce travail, en changeant de point de vue, sans argument de récurrence, nous étudions la structure des intersections résiduelles en construisant un complexe borné de modules de type fini C dont la queue consiste en des modules libres et les autres modules sont une somme directe finie de cycles du complexe de Koszul. Il est montré que ce complexe est acyclique sous une condition de profondeur sur les cycles du complexe de Koszul. De plus ce complexe a pour seule homologie non nulle un idéal proche du résiduel, et qui coincide avec celui-ci sous une hypothése assez faible. Cela nous permet de montrer que dans un anneau de Cohen-Macaulay une intersection résiduelle géométrique d'un idéal satisfaisant la condition "Sliding Depth" est toujours de Cohen-Macaulay. Cela répond par l'affrmative à l'une des principales questions concernant les intersections résiduelles, selon C. Huneke et B. Ulrich. A l'aide d'une telle résolution, nous montrons une borne pour la régularité de Castelnuovo-Mumford des intersections résiduelles en termes des degrés des équations définissantes. La détermination de cette borne demande une étudie fine des décalages apparaissant dans C. Plus précisément, nous prouvons que dans un anneau gradué standard de Cohen-Macaulay sur un anneau local de dimension au plus 1, si J = a : I est une intersection résiduelle (géométrique) d'un idéal I de grade g > 0 qui vérifie la condition SD_1 (par exemple fortement de Cohen-Macaulay) alors reg(R/J) ≤reg(R) + dim(R_0) + σ(a) - (s - g + 1) indeg(I/a) - s. Il est aussi montré que cette inégalité est une égalité lorsque R_0 est un corps et I est parfait de codimension 2.
APA, Harvard, Vancouver, ISO, and other styles
48

Shi, Bibo. "Regularity-Guaranteed Transformation Estimation in Medical Image Registration." Ohio University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1312842132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Zeytuncu, Yunus Ergin. "Lp and Sobolev Regularity of Weighted Bergman Projections." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1273761421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Ferdinand, Vanessa Anne. "Inductive evolution : cognition, culture, and regularity in language." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/11741.

Full text
Abstract:
Cultural artifacts, such as language, survive and replicate by passing from mind to mind. Cultural evolution always proceeds by an inductive process, where behaviors are never directly copied, but reverse engineered by the cognitive mechanisms involved in learning and production. I will refer to this type of evolutionary change as inductive evolution and explain how this represents a broader class of evolutionary processes that can include both neutral and selective evolution. This thesis takes a mechanistic approach to understanding the forces of evolution underlying change in culture over time, where the mechanisms of change are sought within human cognition. I define culture as anything that replicates by passing through a cognitive system and take language as a premier example of culture, because of the wealth of knowledge about linguistic behaviors (external language) and its cognitive processing mechanisms (internal language). Mainstream cultural evolution theories related to social learning and social transmission of information define culture ideationally, as the subset of socially-acquired information in cognition that affects behaviors. Their goal is to explain behaviors with culture and avoid circularity by defining behaviors as markedly not part of culture. I take a reductionistic approach and argue that all there is to culture is brain states and behaviors, and further, that a complete explanation of the forces of cultural change can not be explained by a subset of cognition related to social learning, but necessarily involves domain-general mechanisms, because cognition is an integrated system. Such an approach should decompose culture into its constituent parts and explore 1) how brains states effect behavior, 2) how behavior effects brain states, and 3) how brain states and behaviors change over time when they are linked up in a process of cultural transmission, where one person's behavior is the input to another. I conduct several psychological experiments on frequency learning with adult learners and describe the behavioral biases that alter the frequencies of linguistic variants over time. I also fit probabilistic models of cognition to participant data to understand the inductive biases at play during linguistic frequency learning. Using these inductive and behavioral biases, I infer a Markov model over my empirical data to extrapolate participants' behavior forward in cultural evolutionary time and determine equivalences (and divergences) between inductive evolution and standard models from population genetics. As a key divergence point, I introduce the concept of non-binomial cultural drift, argue that this is a rampant form of neutral evolution in culture, and empirically demonstrate that probability matching is one such inductive mechanism that results in non-binomial cultural drift. I argue further that all inductive problems involving representativeness are potential drivers of neutral evolution unique to cultural systems. I also explore deviations from probability matching and describe non-neutral evolution due to inductive regularization biases in a linguistic and non-linguistic domain. Here, I offer a new take on an old debate about the domain-specificity vs -generality of the cognitive mechanisms involved in language processing, and show that the evolution of regularity in language cannot be predicted in isolation from the general cognitive mechanisms involved in frequency learning. Using my empirical data on regularization vs probability matching, I demonstrate how the use of appropriate non-binomial null hypotheses offers us greater precision in determining the strength of selective forces in cultural evolution.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!