A cohomological construction of quantization functors of Lie bialgebras

We propose a variant to the Etingof-Kazhdan construction of quantization functors. We construct the twistor J_Φ associated to an associator Φ using cohomological techniques. We then introduce a criterion ensuring that the “left Hopf algebra” of a quasitriangular QUE algebra is flat. We prove that this criterion is satisfied at the universal level. This gives a construction of quantization functors, equivalent to the Etingof-Kazhdan construction.     

Effective PCA for high-dimension, low-sample-size data with noise reduction via geometric representations

In this article, we propose a new estimation methodology to deal with PCA for high-dimension, low-sample-size (HDLSS) data. We first show that HDLSS datasets have different geometric representations depending on whether a ρ-mixing-type dependency appears in variables or not. When the ρ-mixing-type dependency appears in variables, the HDLSS data converge to an n-dimensional surface of unit sphere with increasing dimension. We pay special attention to this phenomenon. We propose a method called the noise-reduction methodology to estimate eigenvalues of a HDLSS dataset. We show that the eigenvalue estimator holds consistency properties along with its limiting distribution in HDLSS context. We consider consistency properties of PC directions. We apply the noise-reduction methodology to estimating PC scores. We also give an application in the discriminant analysis for HDLSS datasets by using the inverse covariance matrix estimator induced by the noise-reduction methodology.     

Relaxing support vectors for classification

We introduce a novel modification to standard support vector machine (SVM) formulations based on a limited amount of penalty-free slack to reduce the influence of misclassified samples or outliers. We show that free slack relaxes support vectors and pushes them towards their respective classes, hence we use the name relaxed support vector machines (RSVM) for our method. We present theoretical properties of the RSVM formulation and develop its dual formulation for nonlinear classification via kernels. We show the connection between the dual RSVM and the dual of the standard SVM formulations. We provide error bounds for RSVM and show it to be stable, universally consistent and tighter than error bounds for standard SVM. We also introduce a linear programming version of RSVM, which we call RSVMLP. We apply RSVM and RSVMLP to synthetic data and benchmark binary classification problems, and compare our results with standard SVM classification results. We show that relaxed influential support vectors may lead to better classification results. We develop a two-phase method called RSVM² for multiple instance classification (MIC) problems, where RSVM formulations are used as classifiers. We extend the two-phase method to the linear programming case and develop RSVMLP². We demonstrate the classification characteristics of RSVM² and RSVMLP², and report our classification results compared to results obtained by other SVM-based MIC methods on public benchmark datasets. We show that both RSVM² and RSVMLP² are faster and produce more accurate classification results.     

Partitions of graphs into cographs

Cographs form the minimal family of graphs containing K₁ that is closed with respect to complementation and disjoint union. We discuss vertex partitions of graphs into the smallest number of cographs. We introduce a new parameter, calling the minimum order of such a partition the c-chromatic number of the graph. We begin by axiomatizing several well-known graphical parameters as motivation for this function. We present several bounds on c-chromatic number in terms of well-known expressions. We show that if a graph is triangle-free, then its chromatic number is bounded between the c-chromatic number and twice this number. We show that both bounds are sharp for graphs with arbitrarily high girth. This provides an alternative proof to a result by Broere and Mynhardt; namely, there exist triangle-free graphs with arbitrarily large c-chromatic numbers. We show that any planar graph with girth at least 11 has a c-chromatic number at most two. We close with several remarks on computational complexity. In particular, we show that computing the c-chromatic number is NP-complete for planar graphs.     

Stability and localization of unbounded solutions of a nonlinear heat equation in a plane

The article investigates unbounded solutions of the equation u _t = div (u ^σgrad u) + u ^β in a plane. We numerically analyze the stability of two-dimensional self-similar solutions (structures) that increase with blowup. We confirm structural stability of the simple structure with a single maximum and metastability of complex structures. We prove structural stability of the radially symmetrical structure with a zero region at the center and investigate its attraction region. We study the effect of various perturbations of the initial function on the evolution of self-similar solutions. We further investigate how arbitrary compact-support initial distributions attain the self-similar mode, including distributions whose support is different from a disk. We show that the self-similar mode described by a simple radially symmetrical structure is achieved only in the central region, while the entire localization region does not have enough time to transform into a disk during blowup. We show for the first time that simple structures may merge into a complex structure, which evolves for a long time according to self-similar law.     

Mathematics teacher education advanced methods: an example in dynamic geometry

We present a research work about an innovative national teacher training program in France: the Pairform@nce program, designed to sustain ICT integration. We study here training for secondary school teachers, whose objective is to foster the development of an inquiry-based approach in the teaching of mathematics, using investigative potentialities of dynamic geometry environments. We adopt the theoretical background of the documentational approach to didactics. We focus on the interactions between teachers and resources: teachers’ professional knowledge influences these interactions, which at the same time yield knowledge evolutions, a twofold process that we conceptualise as a documentational genesis. We followed in particular the work of a team of trainees; drawing on the data collected, we analyse their professional development, related with the training. We observe intertwined evolutions and stabilities, consistent with ongoing geneses.     

Effective PCA for high-dimension, low-sample-size data with singular value decomposition of cross data matrix

In this paper, we propose a new methodology to deal with PCA in high-dimension, low-sample-size (HDLSS) data situations. We give an idea of estimating eigenvalues via singular values of a cross data matrix. We provide consistency properties of the eigenvalue estimation as well as its limiting distribution when the dimension d and the sample size n both grow to infinity in such a way that n is much lower than d. We apply the new methodology to estimating PC directions and PC scores in HDLSS data situations. We give an application of the findings in this paper to a mixture model to classify a dataset into two clusters. We demonstrate how the new methodology performs by using HDLSS data from a microarray study of prostate cancer.     

An integrable hierarchy including the AKNS hierarchy and its strict version

We present an integrable hierarchy that includes both the AKNS hierarchy and its strict version. We split the loop space g of gl₂ into Lie subalgebras g≥0 and g<0 of all loops with respectively only positive and only strictly negative powers of the loop parameter. We choose a commutative Lie subalgebra C in the whole loop space s of sl₂ and represent it as C = C≥0⊕C<0. We deform the Lie subalgebras C≥0 and C<0 by the respective groups corresponding to g<0 and g≥0. Further, we require that the evolution equations of the deformed generators of C≥0 and C<0 have a Lax form determined by the original splitting. We prove that this system of Lax equations is compatible and that the equations are equivalent to a set of zero-curvature relations for the projections of certain products of generators. We also define suitable loop modules and a set of equations in these modules, called the linearization of the system, from which the Lax equations of the hierarchy can be obtained. We give a useful characterization of special elements occurring in the linearization, the so-called wave matrices. We propose a way to construct a rather wide class of solutions of the combined AKNS hierarchy.     

q-Discrete Painlevé equations for recurrence coefficients of modified q-Freud orthogonal polynomials

We present an asymmetric q-Painlevé equation. We will derive this using q-orthogonal polynomials with respect to generalized Freud weights: their recurrence coefficients will obey this q-Painlevé equation (up to a simple transformation). We will show a stable method of computing a special solution, which gives the recurrence coefficients. We establish a connection with α-q-P_V.     

On the Shape Sensitivity of the First Dirichlet Eigenvalue for Two-Phase Problems

We consider a two-phase problem in thermal conductivity: inclusions filled with a material of conductivity σ ₁ are layered in a body of conductivity σ ₂. We address the shape sensitivity of the first eigenvalue associated with Dirichlet boundary conditions when both the boundaries of the inclusions and the body can be modified. We prove a differentiability result and provide the expressions of the first and second order derivatives. We apply the results to the optimal design of an insulated body. We prove the stability of the optimal design thanks to a second order analysis. We also continue the study of an extremal eigenvalue problem for a two-phase conductor in a ball initiated by Conca et al. (Appl. Math. Optim. 60(2):173–184, 2009) and pursued in Conca et al. (CANUM 2008, ESAIM Proc., vol. 27, pp.  311–321, EDP Sci., Les Ulis, 2009).     

Friedman-reflexivity

In the present paper, we explore an idea of Harvey Friedman to obtain a coordinate-free presentation of consistency. For some range of theories, Friedman's idea delivers actual consistency statements (modulo provable equivalence). For a wider range, it delivers consistency-like statements.We say that a sentence C is an interpreter of a finitely axiomatised A over U iff it is the weakest statement C over U, with respect to U-provability, such that $U+C$ interprets A. A theory U is Friedman-reflexive iff every finitely axiomatised A has an interpreter over U. Friedman shows that Peano Arithmetic, PA, is Friedman-reflexive.We study the question which theories are Friedman-reflexive. We show that a very weak theory, Peano Corto, is Friedman-reflexive. We do not get the usual consistency statements here, but bounded, cut-free, or Herbrand consistency statements. We illustrate that Peano Corto as a base theory has additional desirable properties.We prove a characterisation theorem for the Friedman-reflexivity of sequential theories. We provide an example of a Friedman-reflexive sequential theory that substantially differs from the paradigm cases of Peano Arithmetic and Peano Corto.Interpreters over a Friedman-reflexive U can be used to define a provability-like notion for any finitely axiomatised A that interprets U. We explore what modal logics this idea gives rise to. We call such logics interpreter logics. We show that, generally, these logics satisfy the Löb Conditions, aka K4. We provide conditions for when interpreter logics extend S4, K45, and Löb's Logic. We show that, if either U or A is sequential, then the condition for extending Löb's Logic is fulfilled. Moreover, if our base theory U is sequential and if, in addition, its interpreters can be effectively found, we prove Solovay's Theorem. This holds even if the provability-like operator is not necessarily representable by a predicate of Gödel numbers.At the end of the paper, we briefly discuss how successful the coordinate-free approach is.     

Ear-decompositions of matching-covered graphs

We call a graphmatching-covered if every line belongs to a perfect matching. We study the technique of “ear-decompositions” of such graphs. We prove that a non-bipartite matching-covered graph containsK ₄ orK ₂⊕K ₃ (the triangular prism). Using this result, we give new characterizations of those graphs whose matching and covering numbers are equal. We apply these results to the theory of τ-critical graphs.     

The structure of hemispaces in Rn

We study hemispaces (i,e., convex sets with convex complements) in Rⁿ. We give several geometric characterizations of hemispaces and several ways of representing them with the aid of linear operators and lexicographical order. We obtain a metric-affine classification of hemispaces, in terms of their “rank” and “type,” and a “decomposition theorem.” We also give some characterizations of affine transformations which preserve a hemispace.     

Deformations of Oka manifolds

We investigate the behaviour of the Oka property with respect to deformations of compact complex manifolds. We show that in a family of compact complex manifolds, the set of Oka fibres corresponds to a G _δ subset of the base. We give a necessary and sufficient condition for the limit fibre of a sequence of Oka fibres to be Oka in terms of a new uniform Oka property. We show that if the fibres are tori, then the projection is an Oka map. Finally, we consider holomorphic submersions with noncompact fibres.     

Hauteurs de sous-espaces sur les corps non commutatifs

We study heights of subspaces of D ^N where D is a finite-dimensional rational division algebra and N a positive integer. We define them in terms of volumes of Euclidean lattices by extending a formula of W. Schmidt so that we recover the classical height if D is commutative. We review basic properties, prove a Siegel Lemma over D, a duality theorem and a new formula for the degree of certain abelian varieties. We further give matrix versions and compare our notion with the height defined through algebraic groups by J. Franke, Y. Manin and Y. Tschinkel.