On invariant Rings of Sylow subgroups of finite classical groups

In this thesis we study the invariant rings for the Sylow p-subgroups of the nite classical groups. We have successfully constructed presentations for the invariant rings for the Sylow p-subgroups of the unitary groups GU(3; Fq2) and GU(4; Fq2 ), the symplectic group Sp(4; Fq) and the orthogonal group O+(4; Fq) with q odd. In all cases, we obtained a minimal generating set which is also a SAGBI basis. Moreover, we computed the relations among the generators and showed that the invariant ring for these groups are a complete intersection. This shows that, even though the invariant rings of the Sylow p-subgroups of the general linear group are polynomial, the same is not true for Sylow p-subgroups of general classical groups. We also constructed the generators for the invariant elds for the Sylow p-subgroups of GU(n; Fq2 ), Sp(2n; Fq), O+(2n; Fq), O-(2n + 2; Fq) and O(2n + 1; Fq), for every n and q. This is an important step in order to obtain the generators and relations for the invariant rings of all these groups.

Critical exponents for a transition from integrability to non-integrability via localization of invariant tori in the Hamiltonian system

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Locating invariant tori for a family of two-dimensional Hamiltonian mappings

The location of invariant tori for a two-dimensional Hamiltonian mapping exhibiting mixed phase space is discussed. The phase space of the mapping shows a large chaotic sea surrounding periodic islands and limited by a set of invariant tori. Given the mapping considered is parameterised by an exponent γ in one of the dynamical variables, a connection with the standard mapping near a transition from local to global chaos is used to estimate the position of the invariant tori limiting the size of the chaotic sea for different values of the parameter γ. © 2011 Elsevier B.V. All rights reserved.

The cohomological invariant E'(G,W) and some properties

Let G be a group, W a nonempty G-set and M a Z2G-module. Consider the restriction map resG W : H1(G,M) → Pi wi∈E H1(Gwi,M), [f] → (resGG wi [f])i∈I , where E = {wi, i ∈ I} is a set of orbit representatives in W and Gwi = {g ∈ G | gwi = wi} is the G-stabilizer subgroup (or isotropy subgroup) of wi, for each wi ∈ E. In this work we analyze some results presented in Andrade et al [5] about splittings and duality of groups, using the point of view of Dicks and Dunwoody [10] and the invariant E'(G,W) := 1+dimkerresG W, defined when Gwi is a subgroup of infinite index in G for all wi in E, andM = Z2 (where dim = dimZ2). We observe that the theory of splittings of groups (amalgamated free product and HNN-groups) is inserted in the combinatory theory of groups which has many applications in graph theory (see, for example, Serre [12] and Dicks and Dunwoody [10]).

CID: an efficient complexity-invariant distance for time series

The ubiquity of time series data across almost all human endeavors has produced a great interest in time series data mining in the last decade. While dozens of classification algorithms have been applied to time series, recent empirical evidence strongly suggests that simple nearest neighbor classification is exceptionally difficult to beat. The choice of distance measure used by the nearest neighbor algorithm is important, and depends on the invariances required by the domain. For example, motion capture data typically requires invariance to warping, and cardiology data requires invariance to the baseline (the mean value). Similarly, recent work suggests that for time series clustering, the choice of clustering algorithm is much less important than the choice of distance measure used.In this work we make a somewhat surprising claim. There is an invariance that the community seems to have missed, complexity invariance. Intuitively, the problem is that in many domains the different classes may have different complexities, and pairs of complex objects, even those which subjectively may seem very similar to the human eye, tend to be further apart under current distance measures than pairs of simple objects. This fact introduces errors in nearest neighbor classification, where some complex objects may be incorrectly assigned to a simpler class. Similarly, for clustering this effect can introduce errors by “suggesting” to the clustering algorithm that subjectively similar, but complex objects belong in a sparser and larger diameter cluster than is truly warranted.We introduce the first complexity-invariant distance measure for time series, and show that it generally produces significant improvements in classification and clustering accuracy. We further show that this improvement does not compromise efficiency, since we can lower bound the measure and use a modification of triangular inequality, thus making use of most existing indexing and data mining algorithms. We evaluate our ideas with the largest and most comprehensive set of time series mining experiments ever attempted in a single work, and show that complexity-invariant distance measures can produce improvements in classification and clustering in the vast majority of cases.

Search for Quantum Black Hole Production in High-Invariant-Mass Lepton plus Jet Final States Using pp Collisions at root s=8 TeV and the ATLAS Detector

This Letter presents a search for quantum black-hole production using 20.3 fb(-1) of data collected with the ATLAS detector in pp collisions at the LHC at root s = 8 TeV. The quantum black holes are assumed to decay into a final state characterized by a lepton (electron or muon) and a jet. In either channel, no event with a lepton-jet invariant mass of 3.5 TeV or more is observed, consistent with the expected background. Limits are set on the product of cross sections and branching fractions for the lepton + jet final states of quantum black holes produced in a search region for invariant masses above 1 TeV. The combined 95% confidence level upper limit on this product for quantum black holes with threshold mass above 3.5 TeV is 0.18 fb. This limit constrains the threshold quantum black-hole mass to be above 5.3 TeV in the model considered.

On the existence of uni-instantaneous Q-processes with a given finite mu-invariant measure

Let S be a countable set and let Q = (q(ij), i, j is an element of S) be a conservative q-matrix over S with a single instantaneous state b. Suppose that we are given a real number mu >= 0 and a strictly positive probability measure m = (m(j), j is an element of S) such that Sigma(i is an element of S) m(i)q(ij) = -mu m(j), j 0 b. We prove that there exists a Q-process P(t) = (p(ij) (t), i, j E S) for which m is a mu-invariant measure, that is Sigma(i is an element of s) m(i)p(ij)(t) = e(-mu t)m(j), j is an element of S. We illustrate our results with reference to the Kolmogorov 'K 1' chain and a birth-death process with catastrophes and instantaneous resurrection.

The Lindelöf number greater than continuum is u-invariant

2000 Mathematics Subject Classification: 54C35, 54D20, 54C60.

An application of fractal image-set coding in facial recognition

Faces are complex patterns that often differ in only subtle ways. Face recognition algorithms have difficulty in coping with differences in lighting, cameras, pose, expression, etc. We propose a novel approach for facial recognition based on a new feature extraction method called fractal image-set encoding. This feature extraction method is a specialized fractal image coding technique that makes fractal codes more suitable for object and face recognition. A fractal code of a gray-scale image can be divided in two parts – geometrical parameters and luminance parameters. We show that fractal codes for an image are not unique and that we can change the set of fractal parameters without significant change in the quality of the reconstructed image. Fractal image-set coding keeps geometrical parameters the same for all images in the database. Differences between images are captured in the non-geometrical or luminance parameters – which are faster to compute. Results on a subset of the XM2VTS database are presented.