Two new sets of ellipse-related concyclic points

Two new circles (denoted by Γ _I and Γ _E ) are shown to be associated with any ellipse. Their analogies with two circles described by Barlotti are described. Two further new circles—denoted by Ω and Γ—are shown to be associated with any general point P of the ellipse. Tight relationships link the circles Ω and Γ with the circle K (previously introduced by the present author), as well as with Monge’s orthoptic circle, with Barlotti’s circles and with the circles Γ _I and Γ _E . In particular, the circle Ω is orthogonal to Monge’s circle. A new special point of the ellipse (the point T) is described. New properties of Fagnano’s point are described.     

Modules de cycles et motifs mixtes

For a perfect field k, we give a relation between the category of homotopy invariant sheaves with transfers defined by Voevodsky and the category of cycle modules defined by Rost. More precisely, the category of cycle modules over k is equivalent to the category obtained from the homotopy invariant sheaves with transfers by formally inverting the sheaf represented by $\text{G}{}_{\mathrm{m}}$ with its canonical structure of a presheaf with transfers. This gives a canonical monoidal structure on the category of cycle modules over k, and shows that it is Abelian. To cite this article: F. Déglise, C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

Spectral characterization of graphs whose second largest eigenvalue is less than 1

Graphs with second largest eigenvalue λ₂?1 are extensively studied, however, whether they are determined by their adjacency spectra or not is less considered. In this paper we completely characterize all the connected bipartite graphs with λ₂<1 that are determined by their adjacency spectra. In addition, we prove that all the connected non-bipartite graphs with girth no less than 4 and λ₂<1 are determined by their adjacency spectra.     

On a signless Laplacian spectral characterization of -shape trees

Let M be an associated matrix of a graph G (the adjacency, Laplacian and signless Laplacian matrix). Two graphs are said to be cospectral with respect to M if they have the same M spectrum. A graph is said to be determined by M spectrum if there is no other non-isomorphic graph with the same spectrum with respect to M. It is shown that T-shape trees are determined by their Laplacian spectra. Moreover among them those are determined by their adjacency spectra are characterized. In this paper, we identify graphs which are cospectral to a given T-shape tree with respect to the signless Laplacian matrix. Subsequently, T-shape trees which are determined by their signless Laplacian spectra are identified.     

Zariski closure, completeness and compactness

The categorical theory of closure operators is used to introduce and study separated, complete and compact objects with respect to the Zariski closure operator naturally defined in any category X(A,Ω) obtained by a given complete category X (endowed with a proper factorization structure for morphisms) and by a given X-algebra (A,Ω) by forming the affine X-objects modelled by (A,Ω). Several basic examples are provided.     

Uniqueness of isometric immersions with the same mean curvature

Motivated by the quasi-local mass problem in general relativity, we study the rigidity of isometric immersions with the same mean curvature into a warped product space. As a corollary of our main result, two star-shaped hypersurfaces in a spatial Schwarzschild or AdS-Schwarzschild manifold with nonzero mass differ only by a rotation if they are isometric and have the same mean curvature. We also prove similar results if the mean curvature condition is replaced by an ${\sigma }_2$-curvature condition.     

On Central Cantor Sets with Self-Arithmetic Difference of Positive Lebesgue Measure

We prove the existence of C^r - (but not C^r+1-) regular centralCantor sets with zero Lebesgue measure such that their selfarithmetic difference is a Cantor set with positive Lebesguemeasure. This is motivated by a conjecture in the field of bifurcationsof dynamical systems posed by Jacob Palis.     

Error-correcting pooling designs associated with some distance-regular graphs

Motivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K_2n considered by Ngo and Du [Ngo and Du, Discrete Math. 243 (2003) 167–170], two families of pooling designs over the incidence matrices oft-cliques (resp. strongly t-cliques) with various sizes of the Johnson graph J(n,t) (resp. the Grassmann graph J_q(n,t)) are considered. Their performances as pooling designs are better than those given by Ngo and Du. Moreover, pooling designs associated with other special distance-regular graphs are also considered.     

Degenerate Second Order Differential Operators Generating Analytic Semigroups in Lp and W1,p

We deal with the problem of analyticity for the semigroup generated by the second order differential operator Au ≔ αu″ + βu′ (or by some restrictions of it) in the spaces L^p(0, 1), with or without weight, and in W^1,p(0, 1), 1 < p < ∞. Here α and β are assumed real‐valued and continuous in [0, 1], with α(x) > 0 in (0, 1), and the domain of A is determined by the generalized Neumann boundary conditions and by Wentzell boundary conditions.     

On bases with unreliability coefficient 2

Consider the realization of Boolean functions by networks from unreliable functional components in a complete basis B ? B ₃ (B ₃ is the set of all Boolean functions depending on the variables x ₁, x ₂, x ₃). It is assumed that all the components of the network are subject to inverse faults at the outputs independently of each other with probability ? ∈ (0, 1/2). In B ₃, we obtain all complete bases in which the following two conditions simultaneously hold: 1) any function can be realized by a network with unreliability asymptotically not greater than 2? (? → 0); 2) there exist functions (denote their set by K) that cannot be realized by networks with unreliability asymptotically less than 2?, ? → 0. Such bases will be called bases with unreliability coefficient 2. It is also proved that the set K contains almost all functions.     

Commuting projections on graphs

Motivated by the increasing importance of large‐scale networks typically modeled by graphs, this paper is concerned with the development of mathematical tools for solving problems associated with the popular graph Laplacian. We exploit its mixed formulation based on its natural factorization as product of two operators. The goal is to construct a coarse version of the mixed graph Laplacian operator with the purpose to construct two‐level, and by recursion, a multilevel hierarchy of graphs and associated operators. In many situations in practice, having a coarse (i.e., reduced dimension) model that maintains some inherent features of the original large‐scale graph and respective graph Laplacian offers potential to develop efficient algorithms to analyze the underlined network modeled by this large‐scale graph. One possible application of such a hierarchy is to develop multilevel methods that have the potential to be of optimal complexity. In this paper, we consider general (connected) graphs and function spaces defined on its edges and its vertices. These two spaces are related by a discrete gradient operator, ‘Grad’ and its adjoint, ‘ ? Div’, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then, a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ?₂‐projection Q_H onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π_H from the original edge‐space onto a properly constructed coarse edge‐space associated with the edges of the coarse graph. The projections π_H and Q_H commute with the discrete divergence operator, that is, we have Div π_H = Q_H div. The respective pair of coarse edge‐space and coarse vertex‐space offer the potential to construct two‐level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian, which utilizes the discrete divergence operator. The performance of one two‐level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples. Copyright © 2013 John Wiley & Sons, Ltd.     

Some extremal problems for trigonometric polynomials

Three extremal problems for trigonometric polynomials are studied in this paper. The first was initiated by Maiorov. It relates to the trigonometric polynomials with n nonzero harmonics. The L_p-norm of the Weyl derivative is compared with the L_q-norm of the polynomial. The other two problems have appeared in the recent paper by Oswald. They deal with the polynomials of degree n. The minimum of L_p-norm with respect to the choice of phases is compared with l_q-norm of its coefficients.     

Transseries for a class of nonlinear difference equations *

Given a nonlinear analytic difference equation of level 1 with a formal power series solution ? ₀ we associate with it a stable manifold of solutions with asymptotic expansion ? ₀. This manifold can be represented by means of Borel summable series. All solutions with asymptotic expansion ? ₀ in some sector can be written as certain exponential series which are called transseries. Some of their properties are investigated: are resurgence properties and Stokes transition. Analogous problems for differential equations have been studied by Costin in [7]     

Smoothness and Best Approximation with Respect to Freud-Type Weights,a New Approach

A new measure of smoothness is defined and related to best approximation by polynomials with respect to weighted L _p (R) with Freud-type weights. Other related norms are also discussed. Comparisons with the known measure of smoothness on weighted L _p spaces are obtained. Related K-functionals and realization functionals are introduced. The new measure of smoothness allows us to consider a more general class of function spaces, to achieve Marchaud, Jackson and Bernstein-type inequalities, and to relate it to expressions involving the coefficients of the expansion by orthogonal polynomials with respect to Freud-type weights. Some of the results are new for approximation by Hermite polynomials in the weighted L _p space with the weight \({e^{-x^{2}}}\) .     

Revenue in contests with many participants

We show that in a contest with a single prize, the expected effort made by the k$k$th highest valuation participant bounds the sum of the expected efforts made by all of the participants with valuations less than the k$k$th highest valuations. We also show that in the limit case of a contest with m$m$ prizes, the expected effort made by the k$k$th highest valuation participant when the bidders are risk-neutral is greater than the expected effort in the risk-averse case.     

Reiteration formulae for interpolation methods associated to polygons

We study spaces generated by applying the interpolation methods defined by a polygon Π to an N-tuple of real interpolation spaces with respect to a fixed Banach couple {X,Y}. We show that if the interior point (α,β) of the polygon does not lie in any diagonal of Π then the interpolation spaces coincide with sums and intersections of real interpolation spaces generated by {X,Y}. Applications are given to N-tuples formed by Lorentz function spaces and Besov spaces. Moreover, we show that results fail in general if (α,β) is in a diagonal.     

On the coverings of graphs

Let ρ(n) denote the smallest integer with the property that any graph with n vertices can be covered by ρ(n) complete bipartite subgraphs. We prove a conjecture of J.-C. Bermond by showing $\text{ρ(n)=n+o(n}{}^{\mathrm{<mtext>11</mtext><mtext>14+?</mtext>}}\text{)}$ for any positive ?.     

Generalized 2-symmetric submanifolds

Summary In this note we give two families of generalized 2-symmetric submanifolds. The first family consists of submanifolds of R ^N which are mapped into theirselves by the reflection of R ^N with respect to each first normal space and it is characterized in a differentiable way. The second family consists of submanifolds obtained by introducing a homomorphism between two Lie groups associated with symmetric R -spaces. All these submanifolds are mapped into theirselves by the reflection of R ^N with respect to subspaces of the normal spaces which contain the first normal spaces.     

A Property of Sobolev Spaces and Existence in Optimal Design

   Abstract. We prove that for bounded open sets Ω with continuous boundary, Sobolev spaces of type W ₀ ^l,p (Ω ) are characterized by the zero extension outside of Ω . Combining this with a compactness result for domains of class C, we obtain a general existence theorem for shape optimization problems governed by nonlinear nonhomogenous Dirichlet boundary value problems of arbitrary order, in arbitrary dimension and with general cost functionals.