The subgroup commutativity degree sd(G) of a finite group G was introduced almost ten years ago and deals with the number of commuting subgroups in the subgroups lattice L(G) of G. The extremal case sd(G) = 1 detects a class of groups classified by Iwasawa in 1941 (in fact sd(G) represents a probabilistic measure which allows us to understand how far is G from the groups of Iwasawa). Among them we have sd(G) = 1 when L(G) is distributive, that is, when G is cyclic. The characterization of a cyclic group by the distributivity of its lattice of subgroups is due to a classical result of Ore in 1938. Therefore sd(G) is strongly related to structural properties of L(G). Here we introduce a new notion of probability gsd(G) in which two arbitrary sublattices S(G) and T(G) of L(G) are involved simultaneously. In case S(G) = T(G) = L(G), we find exactly sd(G). Upper and lower bounds in terms of gsd(G) and sd(G) are among our main contributions, when the condition S(G) = T(G) = L(G) is removed. Then we investigate the problem of counting the pairs of commuting subgroups via an appropriate graph. Looking at the literature, we noted that a similar problem motivated the permutability graph of non–normal subgroups ΓN (G) in 1995, that is, the graph where all proper non– normal subgroups of G form the vertex set of ΓN (G) and two vertices H and K are joined if HK = KH. The graph ΓN (G) has been recently generalized via the notion of permutability graph of subgroups Γ(G), extending the vertex set to all proper subgroups of G and keeping the same criterion to join two vertices. We use gsd(G), in order to introduce the non–permutability graph of subgroups ΓL(G) ; its vertices are now given by the set L(G) − CL(G)(L(G)), where CL(G)(L(G)) is the smallest sublattice of L(G) containing all permutable subgroups of G, and we join two vertices H, K of ΓL(G) if HK 6= KH. We finally study some classical invariants for ΓL(G) and find numerical relations between the number of edges of ΓL(G) and gsd(G).

<div>Lattices composed of bistable elements are of great significance across various fields of science and engineering due to their ability to support a class of solitary waves, called transition waves. Common with all solitary waves, transition waves carry highly concentrated energy with minimal degradation and thus have many useful engineering applications, such as extreme waveguides, bandgap transmission, vibration absorption, and energy harvesting. The rich dynamics arising from the strong nonlinearities of the constitutive bistable microstructures still have much to be unveiled for the practical implementation of the transition waves in real-world engineering structures. Especially, the quasi-particle characteristics of the transition waves can potentially address the performance limits posed by the unit cell size in linear metamaterials.</div><div><br></div><div>In this thesis, we first present an input-independent generation of transition waves in the lattices of asymmetric bistable unit cells when snap-through transitions occur at any site within the lattice. The resulting responses are invariant across the lattice except near the boundaries. These characteristics imply useful applications in broadband energy harvesting, exploiting the highly concentrated energy of the transition waves. We further observe that the inherent lattice discreteness induces dominantly monochromatic oscillatory tail following the main transition wave. This radiated energy of the tail can always be efficiently harvested through resonant transduction regardless of the input excitations. This type of bistable lattice transforms any input disturbance into an output form that can be conveniently transduced; thus, energy harvesting becomes an inherent metamaterial property of the bistable lattice.</div><div><br></div><div>To enhance the responses further for improved energy harvesting capability, we introduce engineered defects in the form of a mass impurity, inhomogeneous inter-site stiffness, and their combinations, achieving localization of energy at desired sites. Remarkably, we also observe a long-lived breather-like mode for the first time in this type of lattice. To enhance the tail motions globally across the lattice, we investigate the responses in a set of bistable lattices with the same mass and elastic densities but with different lattice spacing distances (or lattice discreteness). From the available tail energy, we observe a significant increase in the harvesting capability with the increased lattice discreteness.</div><div><br></div><div>Next, the effect of functional grading on the onsite and inter-site stiffnesses are investigated to augment the control of the transition waves in the bistable lattices. The unidirectionality still remains in the direction of decreasing stiffness, while a boomerang-like wave reversal occurs in the direction of increasing stiffness. Both the compression and rarefaction transition waves are allowed to propagate, enabling continuous transmission of the transition waves without complex resetting mechanisms, thus expanding the bistable lattices' functionality for practical applications.</div><div><br></div><div>The observed input-independent dynamics of the one-dimensional bistable lattices can be extended to higher-dimensional metastructures by allowing macrostructural flexibility. Metabeams composed of spring-joined bistable elements are subjected to in-plane sinusoidal input at the microstructural level, and the out-of-plane responses at the macrosctructural level are measured. As long as transition waves are triggered within the metabeam, the most dominant output frequency occurs near the natural frequency of the macroscopic structure regardless of the input excitations initiating the transition waves, yielding energy transfer between uncorrelated frequencies.</div><div><br></div><div>Finally, high-fidelity in-house numerical solvers are developed for the massively parallelized computation of the problems involving generic bistable architectures, addressing the problem size limit. The improved numerical solution accuracy and computational performance, compared to those of commercial solvers, provide great potential to discover new dynamics by drastically expanding the accessible analysis regimes.</div><div><br></div><div>The experiments, simulations, and theoretical contributions in this thesis illustrate the possibilities afforded by strongly nonlinear phenomena to tailor the dynamics of materials systems. Importantly, the presented results show mechanisms to affect global dynamic properties unconstrained by the unit cell size, thereby offering new routes to extreme dynamics beyond current metamaterial architectures.</div>

No description available.

<p>Data je karakterizacija raznih tipova specijalnih elemenata mreže, kao &scaron;to su kodistributivni, neutralni, skrativi, standardni, izuzetni, neprekidni, beskonačno distributivni i drugi i ti rezultati su primenjeni u strukturnim ispitivanjima algebri, posebno u mrežama kongruencija, podalgebri i slabih kongruencija algebri.&nbsp; Specijalni elementi su posebno proučavani i u bipolumrežama i dobijene su nove teoreme reprezentacije za bipolumreže. Ispitana je kolekcija svih mreža sa istim skupom i-nerazloživih elemenata, pokazano je da je ta kolekcija i sama mreža u odnosu na inkluziju i daju se karakterizacije te mreže.&nbsp; Re&scaron;avan je problem preno&scaron;enja mrežnih identiteta sa mreže podalgebri i kongruencija na mrežu slabih kongruencija. Proučavane su osobine svojstva preseka kongruencija i svojstva pro&scaron;irenja kongruencija i neke varijante tih svojstava u vezi sa mrežama slabih kongruencija. Date su karakterizacije mreže slabih kongruencija nekih posebnih klasa algebri i varijeteta, kao &scaron;to su unarne algebra, mreže, grupe, Hamiltonove algebra i druge.</p> / <p>A characterization of various types of special elements in lattices: codistributive,&nbsp; neutral, cancellable, standard, exceptional, continuous, infinitely distributive and others are given, and the results are applied in structural investigations in algebras, in particular in lattices of subalgebras, congruences and weak congruences. Special elements are investigated also in bi-semilattices and new representation theorems for bisemilattices are obtained. The collection of all lattices with the same poset of meet-irreducible elements is studied and it is proved that this collection is a lattice under inclusion and characterizations of this lattice is given.&nbsp; A problem of transferability of lattice identities from lattices of subalgebras and congruences to&nbsp; lattices of weak congruencse of&nbsp; algebras is solved. The congruence intersection property and the congruence extension property as well as various alternations of these properties are investigated in connection with weak congruence lattices. Characterizations of weak congruence lattices of special classes of algebras and varieties, as unary algebras, lattices, groups, Hamiltonian algebras and others are given.</p>

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Nuclear Engineering, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Includes bibliographical references. / by Francisco Javier Carrion. / M.S.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Nuclear Engineering, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Includes bibliographical references. / by Khaled Awni Touqan. / Ph.D.

<div>We further the research in o-minimal topology by studying in full generality definable topological spaces in o-minimal structures. These are topological spaces $(X, \tau)$, where $X$ is a definable set in an o-minimal structure and the topology $\tau$ has a basis that is (uniformly) definable. Examples include the canonical o-minimal "euclidean" topology, “definable spaces” in the sense of van den Dries [17], definable metric spaces [49], as well as generalizations of classical non-metrizable topological spaces such as the Split Interval and the Alexandrov Double Circle.</div><div><br></div><div>We develop a usable topological framework in our setting by introducing definable analogues of classical topological properties such as separability, compactness and metrizability. We characterize these notions, showing in particular that, whenever the underlying o-minimal structure expands $(\mathbb{R},<)$, definable separability and compactness are equivalent to their classical counterparts, and a similar weaker result for definable metrizability. We prove the equivalence of definable compactness and various other properties in terms of definable curves and types. We show that definable topological spaces in o-minimal expansions of ordered groups and fields have properties akin to first countability. Along the way we study o-minimal definable directed sets and types. We prove a density result for o-minimal types, and provide an elementary proof within o-minimality of a statement related to the known connection between dividing and definable types in o-minimal theories.</div><div><br></div><div>We prove classification and universality results for one-dimensional definable topological spaces, showing that these can be largely described in terms of a few canonical examples. We derive in particular that the three element basis conjecture of Gruenhage [25] holds for all infinite Hausdorff definable topological spaces in o-minimal structures expanding $(\mathbb{R},<)$, i.e. any such space has a definable copy of an interval with the euclidean, discrete or lower limit topology.</div><div><br></div><div>A definable topological space is affine if it is definably homeomorphic to a euclidean space. We prove affineness results in o-minimal expansions of ordered fields. This includes a result for Hausdorff one-dimensional definable topological spaces. We give two new proofs of an affineness theorem of Walsberg [49] for definable metric spaces. We also prove an affineness result for definable topological spaces of any dimension that are Tychonoff in a definable</div><div>sense, and derive that a large class of locally affine definable topological spaces are affine.</div>

Extending an explicit result from Bridson–Conder–Reid, this work provides an algorithm for distinguishing finite quotients between cocompact triangle groups Δ ?and lattices Γ of constant curvature symmetric 2-spaces. Much of our attention will be on when these lattices are Fuchsian groups. We prove that it will suffice to take a finite quotient that is Abelian, dihedral, a subgroup of PSL(<i>n</i>,<b>F</b>_<i>q</i>) (for an odd prime power q), or an Abelian extension of one of these 3 groups. For the latter case, we will require and develop an approach for creating group extensions upon a shared finite quotient of Δ? and Γ which between them have differing degrees of smoothness. Furthermore, on the order of a finite quotient that distinguishes between ?Δ and Γ, we are able to establish an effective upperbound that is superexponential depending on the cone orders appearing in each group.<br>

<p>This work strengthens and extends an algorithm for computing Betti numbers of symmetric semialgebraic sets developed by Basu and Riener in, <em>Vandermonde Varieties, Mirrored Spaces, and the Cohomology of Symmetric Semi-Algebraic Sets</em>. We first adapt a construction of Gabrielov and Vorobjov in, <em>Approximation of Definable Sets by Compact Families, and Upper Bounds on Homotopy and Homology,</em> for replacing arbitrary definable sets by compact ones to the symmetric case. The original construction provided maps from the homotopy and homology groups of the replacement set to those of the original; we show that for sets symmetric relative to the action of some finite reflection group <em>G</em>, we may construct these maps to be equivariant. This modification to the construction for compact replacement allows us to extend Basu and Riener's theorem on which submodules appear in the isotypic decomposition of each cohomology space to sets not necessarily closed and bounded. Furthermore, by utilizing this equivariant compact approximation, we may obtain a precise description of the aforementioned decomposition of each cohomology space, and not merely the final dimension of the space, from Basu and Riener's algorithm.</p> <p><br></p> <p>    Though our equivariant compact replacement holds for <em>G</em> any finite reflection group, Basu and Riener's results only consider the case of the action the of symmetric group, sometimes termed type <em>A</em>. As a first step towards generalizing Basu and Riener's work, we examine the next major class of symmetry: the action of the group of signed permutations (known as type <em>B</em>). We focus our attention on Vandermonde varieties, a key object in Basu and Riener's proofs. We show that the intersection of a type <em>B</em> Vandermonde variety with a fundamental region of type <em>B</em> symmetry is topologically regular. We also prove a result about the intersection of a type <em>B</em> Vandermonde variety with the walls of this fundamental region, leading to the elimination of factors in a different decomposition of the homology spaces.</p>

Parallelization is an important part of modern data systems. However, the non-determinism of thread scheduling introduces the difficult problem of considering all different execution orders when constructing an algorithm. Therefore deterministic-by-design concurrent systems are attractive. A new approach called LVars consists of using data which is part of a lattice, with a predefined join operation. Updates to shared data are carried out using the join operation and thus the updates commute. Together with limiting the reads of shared data, this guarantees a deterministic result. The Reactive Async framework follows a similar approach but has several aspects which can cause a non-deterministic result. The goal with this thesis is to explore how we can ammend Reactive Async in order to guarantee a deterministic result. First an exploration into the subtleties of lattice based data combined with concurrency is made. Then a formal model based on a simple object-oriented language is constructed. The constructed small-step operational semantics and type system are shown to guarantee a form of determinism. This shows that LVars-similar system can be implemented in an object-oriented setting. Furthermore the work can act as a basis for future revisions of Reactive Async and similar frameworks. / Parallellisering är en viktig del i moderna datasystem. Flertrådade applikationer innebär dock en svårighet i och med att programmerare måste ta alla exekveringsordningar i beaktning. Därför är beräkningsmodeller vars resultat är garanterat deterministiskt en attraktiv utväg. En ny modell, kallad LVars, använder gitterstrukturer tillsammans med en supremum-operation för att garantera att uppdateringar av delad data kommuterar. Detta tillsammans med begränsningar av läsning av datan garanterar ett deterministiskt resultat. Reactive Async är ett programmeringsramverk som följer en liknande strategi. Det finns dock flera delar i dess konstruktion som i en oförsiktig programmerares händer kan orsaka att ett programs resultat blir icke-deterministiskt. Målet med detta examensarbete är att utforska vilka modifikationer som skulle kunna göras av Reactive Async för att garantera determinism. Först görs en undersökning av de mer svårförståeliga delarna i kombinationen av gitterbaserad data med flertrådad exekvering. Sedan konstrueras en formell beräkningsmodell baserad på ett enkelt objektorienterat språk. Konstruktionens småstegade operationella semantik tillsammans med dess typsystem visas kunna garantera en form av determinism. Detta visar att ett system liknande LVars kan implementeras i ett objektorienterat språk. Därmed skulle detta arbete kunna ligga till grund för framtida versioner av Reactive Async.