A note on permutation regularity

The existence of a small partition of a combinatorial structure into random-like subparts, a so-called regular partition, has proven to be very useful in the study of extremal problems, and has deep algorithmic consequences. The main result in this direction is the Szemeredi Regularity Lemma in graph theory. In this note, we are concerned with regularity in permutations: we show that every permutation of a sufficiently large set has a regular partition into a small number of intervals. This refines the partition given by Cooper (2006) [10], which required an additional non-interval exceptional class. We also introduce a distance between permutations that plays an important role in the study of convergence of a permutation sequence. (C) 2011 Elsevier B.V. All rights reserved.

Lindelof spaces which are indestructible, productive, or D

We discuss relationships in Lindelof spaces among the properties "indestructible". "productive", "D", and related properties. (C) 2011 Elsevier B.V. All rights reserved.

On d- and D-separability

In this article we study relationships between d-separability and D-separability and present conditions under which these concepts are equivalent. We also study their relationship with D+-separability and define a generalization of discrete generability. (C) 2012 Elsevier B.V. All rights reserved.

Solvability in the large for a class of complex vector fields on the cylinder

This work deals with global solvability of a class of complex vector fields of the form L = partial derivative/partial derivative t + (a(x, t)+ ib(x, t))partial derivative/partial derivative x, where a and b are real-valued C-infinity functions, defined on the cylinder Omega = R x S-1. Relatively compact (Sussmann) orbits are allowed. The connection with Malgrange's notion of L-convexity for supports is investigated. (C) 2011 Elsevier Masson SAS. All rights reserved.

COMMUTATIVE AUTOMORPHIC LOOPS OF ORDER p(3)

A loop is said to be automorphic if its inner mappings are automorphisms. For a prime p, denote by A(p) the class of all 2-generated commutative automorphic loops Q possessing a central subloop Z congruent to Z(p) such that Q/Z congruent to Z(p) x Z(p). Upon describing the free 2-generated nilpotent class two commutative automorphic loop and the free 2-generated nilpotent class two commutative automorphic p-loop F-p in the variety of loops whose elements have order dividing p(2) and whose associators have order dividing p, we show that every loop of A(p) is a quotient of F-p by a central subloop of order p(3). The automorphism group of F-p induces an action of GL(2)(p) on the three-dimensional subspaces of Z(F-p) congruent to (Z(p))(4). The orbits of this action are in one-to-one correspondence with the isomorphism classes of loops from A(p). We describe the orbits, and hence we classify the loops of A(p) up to isomorphism. It is known that every commutative automorphic p-loop is nilpotent when p is odd, and that there is a unique commutative automorphic loop of order 8 with trivial center. Knowing A(p) up to isomorphism, we easily obtain a classification of commutative automorphic loops of order p(3). There are precisely seven commutative automorphic loops of order p(3) for every prime p, including the three abelian groups of order p(3).

A relaxed constant positive linear dependence constraint qualification and applications

In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification by Minchenko and Stakhovski that was called RCRCQ. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and that it asserts the validity of an error bound. We also provide proofs and counter-examples that show the relations of RCRCQ and RCPLD with other known constraint qualifications. In particular, RCPLD is strictly weaker than CPLD and RCRCQ, while still stronger than Abadie's constraint qualification. We also verify that the second order necessary optimality condition holds under RCRCQ.

Continuity of Dynamical Structures for Nonautonomous Evolution Equations Under Singular Perturbations

In this paper we study the continuity of invariant sets for nonautonomous infinite-dimensional dynamical systems under singular perturbations. We extend the existing results on lower-semicontinuity of attractors of autonomous and nonautonomous dynamical systems. This is accomplished through a detailed analysis of the structure of the invariant sets and its behavior under perturbation. We prove that a bounded hyperbolic global solutions persists under singular perturbations and that their nonlinear unstable manifold behave continuously. To accomplish this, we need to establish results on roughness of exponential dichotomies under these singular perturbations. Our results imply that, if the limiting pullback attractor of a nonautonomous dynamical system is the closure of a countable union of unstable manifolds of global bounded hyperbolic solutions, then it behaves continuously (upper and lower) under singular perturbations.

On bifurcation of solutions of the Yamabe problem in product manifolds

We study local rigidity and multiplicity of constant scalar curvature metrics in arbitrary products of compact manifolds. Using (equivariant) bifurcation theory we determine the existence of infinitely many metrics that are accumulation points of pairwise non-homothetic solutions of the Yamabe problem. Using local rigidity and some compactness results for solutions of the Yamabe problem, we also exhibit new examples of conformal classes (with positive Yamabe constant) for which uniqueness holds. (C) 2011 Elsevier Masson SAS. All rights reserved.

A countably compact free Abelian group of size continuum that admits a non-trivial convergent sequence

We show that it is consistent with ZFC that the free Abelian group of cardinality c admits a topological group topology that makes it countably compact with a non-trivial convergent sequence. (C) 2011 Elsevier B.V. All rights reserved.

Generalizations of Lie Algebras

The generalizations of Lie algebras appeared in the modern mathematics and mathematical physics. In this paper we consider recent developments and remaining open problems on the subject. Some of that developments have been influenced by lectures given by Professor Jaime Keller in his research seminar. The survey includes Lie superalgebras, color Lie algebras, Lie algebras in symmetric categories, free Lie tau-algebras, and some generalizations with non-associative enveloping algebras: tangent algebras to analytic loops, bialgebras and primitive elements, non-associative Hopf algebras.

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

Almost p-compact groups

We show that if p is a selective ultrafilter, then for each cardinal alpha <= omega(1), there exists a topological group G such that G(beta) is almost p-compact (in particular, countably compact), for beta < alpha, but G(alpha) is not countably compact. If in addition, we assume Martin's Axiom, then the result above holds for every alpha < c. (C) 2012 Elsevier By. All rights reserved.

Computational tools for comparing asymmetric GARCH models via Bayes factors

In this paper we use Markov chain Monte Carlo (MCMC) methods in order to estimate and compare GARCH models from a Bayesian perspective. We allow for possibly heavy tailed and asymmetric distributions in the error term. We use a general method proposed in the literature to introduce skewness into a continuous unimodal and symmetric distribution. For each model we compute an approximation to the marginal likelihood, based on the MCMC output. From these approximations we compute Bayes factors and posterior model probabilities. (C) 2012 IMACS. Published by Elsevier B.V. All rights reserved.

A novel self consistent calculation approach for the capacitance-voltage characteristics of semiconductor quantum wire transistors based on a split-gate configuration

Purpose - The purpose of this paper is to develop an efficient numerical algorithm for the self-consistent solution of Schrodinger and Poisson equations in one-dimensional systems. The goal is to compute the charge-control and capacitance-voltage characteristics of quantum wire transistors. Design/methodology/approach - The paper presents a numerical formulation employing a non-uniform finite difference discretization scheme, in which the wavefunctions and electronic energy levels are obtained by solving the Schrodinger equation through the split-operator method while a relaxation method in the FTCS scheme ("Forward Time Centered Space") is used to solve the two-dimensional Poisson equation. Findings - The numerical model is validated by taking previously published results as a benchmark and then applying them to yield the charge-control characteristics and the capacitance-voltage relationship for a split-gate quantum wire device. Originality/value - The paper helps to fulfill the need for C-V models of quantum wire device. To do so, the authors implemented a straightforward calculation method for the two-dimensional electronic carrier density n(x,y). The formulation reduces the computational procedure to a much simpler problem, similar to the one-dimensional quantization case, significantly diminishing running time.

Architectures, stability and optimization for clock distribution networks

Synchronous telecommunication networks, distributed control systems and integrated circuits have its accuracy of operation dependent on the existence of a reliable time basis signal extracted from the line data stream and acquirable to each node. In this sense, the existence of a sub-network (inside the main network) dedicated to the distribution of the clock signals is crucially important. There are different solutions for the architecture of the time distribution sub-network and choosing one of them depends on cost, precision, reliability and operational security. In this work we expose: (i) the possible time distribution networks and their usual topologies and arrangements. (ii) How parameters of the network nodes can affect the reachability and stability of the synchronous state of a network. (iii) Optimizations methods for synchronous networks which can provide low cost architectures with operational precision, reliability and security. (C) 2011 Elsevier B. V. All rights reserved.