Spelling suggestions: "subject:"aymmetry"" "subject:"asymmetry""
111 |
Fonts and SymmetryNivens, Ryan Andrew 01 November 2013 (has links)
Using fonts as a context, we will analyze symmetry of fi gures. Diff erent letters and numbers will be measured, and participants will describe items that possess vertical, horizontal, and rotational symmetry. Our discussion and activity will focus on the mathematics of fonts and the presence and absence of symmetry in their design.
|
112 |
Fonts and SymmetryNivens, Ryan Andrew 10 April 2014 (has links)
Using fonts as a context, we will analyze symmetry of fi gures. Diff erent letters and numbers will be measured, and participants will describe items that possess vertical, horizontal, and rotational symmetry. Our discussion and activity will focus on the mathematics of fonts and the presence and absence of symmetry in their design.
|
113 |
Isomorphisms of Landau-Ginzburg B-ModelsCordner, Nathan James 01 May 2016 (has links)
Landau-Ginzburg mirror symmetry predicts isomorphisms between graded Frobenius algebras (denoted A and B) that are constructed from a nondegenerate quasihomogeneous polynomial W and a related group of symmetries G. In 2013, Tay proved that given two polynomials W1, W2 with the same quasihomogeneous weights and same group G, the corresponding A-models built with (W1, G) and (W2, G) are isomorphic. An analogous theorem for isomorphisms between orbifolded B-models remains to be found. This thesis investigates isomorphisms between B-models using polynomials in two variables in search of such a theorem. In particular, several examples are given showing the relationship between continuous deformation on the B-side and isomorphisms that stem as a corollary to Tay's theorem via mirror symmetry. Results on extending known isomorphisms between unorbifolded B-models to the orbifolded case are exhibited. A general pattern for B-model isomorphisms, relating mirror symmetry and continuous deformation together, is also observed.
|
114 |
Symmetric representation of elements of finite groupsGeorge, Timothy Edward 01 January 2006 (has links)
The purpose of the thesis is to give an alternative and more efficient method for working with finite groups by constructing finite groups as homomorphic images of progenitors. The method introduced can be applied to all finite groups that possess symmetric generating sets of involutions. Such groups include all finite non-abelian simple groups, which can then be constructed by the technique of manual double coset enumeration.
|
115 |
Topological Symmetries of R^3January 2018 (has links)
acase@tulane.edu / 1 / Fang Sun
|
116 |
The spatial mechanisms mediating the perception of mirror symmetry in human vision /Rainville, Stéphane Jean Michel. January 1999 (has links)
No description available.
|
117 |
The role of chiral symmetry in extrapolations of lattice QCD results to the physical regimeHackett-Jones, E. J. (Emily Jane) January 2001 (has links) (PDF)
Copies of author's previously published works inserted. Bibliography: p. 56-57.
|
118 |
An Algorithm for Computing the Symmetry Point of a PolytopeBelloni, Alexandre, Freund, Robert M. 01 1900 (has links)
Given a closed convex set C and a point x in C, let sym(x,C) denote the symmetry value of x in C, which essentially measures how symmetric C is about the point x. Denote by sym(C) the largest value of sym(x,C) among all x in C, and let x* denote the most symmetric point in C. These symmetry measures are all invariant under linear transformation, change in inner product, etc., and so are of interest in the study of the geometry of convex sets and arise naturally in the evaluation of the complexity of interior-point methods in particular. Herein we show that when C is given by the intersection of halfspaces, i.e., C={x | Ax <= b}, then x* as well as the symmetry value of C can be computed by using linear programming. Furthermore, given an approximate analytic center of C, there is a strongly polynomial-time algorithm for approximating sym(C) to any given relative tolerance. / Singapore-MIT Alliance (SMA)
|
119 |
Recognition and Structure from One 2D Model View: Observations on Prototypes, Object Classes and SymmetriesPoggio, Tomaso, Vetter, Thomas 01 February 1992 (has links)
In this note we discuss how recognition can be achieved from a single 2D model view exploiting prior knowledge of an object's structure (e.g. symmetry). We prove that for any bilaterally symmetric 3D object one non- accidental 2D model view is sufficient for recognition. Symmetries of higher order allow the recovery of structure from one 2D view. Linear transformations can be learned exactly from a small set of examples in the case of "linear object classes" and used to produce new views of an object from a single view.
|
120 |
Temporal symmetry of some classes of stochastic processesLéonard, Christian, Roelly, Sylvie, Zambrini, Jean-Claude January 2013 (has links)
In this article we analyse the structure of Markov processes and reciprocal processes to underline their time symmetrical properties, and to compare them. Our originality consists in adopting a unifying approach of reciprocal processes, independently of special frameworks in which the theory was developped till now (diffusions, or pure jump processes). This leads to some new results, too.
|
Page generated in 0.0494 seconds