Degree sequence and supereulerian graphs

A sequence d=(d₁,d₂,…,d_n) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is line-hamiltonian if d has a realization G such that L(G) is hamiltonian, and is supereulerian if d has a realization G with a spanning eulerian subgraph. In this paper, it is proved that a nonincreasing graphic sequence d=(d₁,d₂,…,d_n) has a supereulerian realization if and only if d_n≥2 and that d is line-hamiltonian if and only if either d₁=n−1, or ∑_di=1d_i≤∑_dj≥2(d_j−2).     

Graphic Sequences with an A-Connected Realization

A non-increasing sequence \({\pi = (d_1, d_2, \ldots, d_n)}\) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. Let A be an (additive) abelian group. An extremal problem for a graphic sequence to have an A-connected realization is considered as follows: determine the smallest even integer \({\sigma (A, n)}\) such that each graphic sequence \({\pi = (d_1, d_2, \ldots, d_n)}\) with d _n ≥ 2 and \({\sigma (\pi) = d_1 + d_2 + \cdots +d_n \ge \sigma (A, n)}\) has an A-connected realization. In this paper, we determine \({\sigma (A, n)}\) for |A| ≥ 5 and n ≥ 3.     

On almost-periodic linear differential systems of Millionščikov and Vinograd

If P_n(x, y) and Q_n(x, y) are real homogeneous polynomials of degree n with no common real linear factors, then the system $\text{x}\text{?}\text{= P}{}_{\mathrm{n}}\text{,}\text{y}\text{?}\text{= Q}{}_{\mathrm{n}}$ has a unique critica point at the origin. If the origin is a non-rotation point, the global structure of the system in the plane is a sequence of sectors separated by integral rays, which is symmetric with respect to the origin. Consider the problem of realizing a similar global picture for which the sequence of sectors is not symmetric, by polynomial vector fields of minimal degree. The schemes are characterized for which such a realization is possible and examples are constructed. For the homogeneous case, a method is given for finding P_n and Q_n from the scheme which is simpler than the original method of Forster.     

Constructive approximations to the invariant densities of higher-dimensional transformations

Let τ be a piecewiseC ² transformation on a rectangular partition of then-dimensional cube which has a unique absolutely continuous invariant measure. An approximation to τ by a sequence of Jablonski transformations is presented and it is shown that the associated sequence of invariant density functions converges to the density function invariant under τ. An example is presented.     

Multidimensional Farey partitions

The linear action of SL(n, ?₊) induces lattice partitions on the (n − 1)-dimensional simplex †n−1. The notion of Farey partition raises naturally from a matricial interpretation of the arithmetical Farey sequence of order r. Such sequence is unique and, consequently, the Farey partition of order r on A 1 is unique. In higher dimension no generalized Farey partition is unique. Nevertheless in dimension 3 the number of triangles in the various generalized Farey partitions is always the same which fails to be true in dimension n > 3. Concerning Diophantine approximations, it turns out that the vertices of an n-dimensional Farey partition of order r are the radial projections of the lattice points in ?₊ⁿ ∩ [0, r]ⁿ whose coordinates are relatively prime. Moreover, we obtain sequences of multidimensional Farey partitions which converge pointwisely.     

A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic

The split graph K _r + $\overline {{K_s}} $ on r+s vertices is denoted by S _r,s . A non-increasing sequence π = (d ₁, d ₂, …, d _n ) of nonnegative integers is said to be potentially S _r,s -graphic if there exists a realization of π containing S _r,s as a subgraph. In this paper, we obtain a Havel-Hakimi type procedure and a simple sufficient condition for π to be potentially S _r,s -graphic. They are extensions of two theorems due to A.R.Rao (The clique number of a graph with given degree sequence, Graph Theory, Proc. Symp., Calcutta 1976, ISI Lect. Notes Series 4 (1979), 251–267 and An Erd?s-Gallai type result on the clique number of a realization of a degree sequence, unpublished).     

Stable étale realization and étale cobordism

We show that there is a stable homotopy theory of profinite spaces and use it for two main applications. On the one hand we construct an étale topological realization of the stable A¹-homotopy theory of smooth schemes over a base field of arbitrary characteristic in analogy to the complex realization functor for fields of characteristic zero.On the other hand we get a natural setting for étale cohomology theories. In particular, we define and discuss an étale topological cobordism theory for schemes. It is equipped with an Atiyah-Hirzebruch spectral sequence starting from étale cohomology. Finally, we construct maps from algebraic to étale cobordism and discuss algebraic cobordism with finite coefficients over an algebraically closed field after inverting a Bott element.     

Stability in CAN-free graphs

A class $\text{F}$ of graphs characterized by three forbidden subgraphs C, A, N is considered; C is the claw (the unique graph with degree sequence (1, 1, 1, 3)), A is the antenna (a graph with degree sequence (1, 2, 2, 3, 3, 3) which does not contain C), and N is the net (the unique graph with degree sequence (1, 1, 1, 3, 3, 3)). These graphs are called CAN-free. A construction is described which associates with every CAN-free graph G another CAN-free graph G′ with strictly fewer nodes than G and with stbility number α(G′) = α(G) ? 1. This gives a good algorithm for determining the stability number of CAN-free graphs.     

Convergence of minimizing sequences

A functional f defined on a closed convex subset C of a normed space is to be minimized. It is known that if f is strictly convex and C is compact, then any minimizing sequence converges in norm to a unique minimum. A characterization is given herein for the norm convergence of any minimizing sequence when C is weakly compact and f is strictly quasi-convex, a more general result than those which are already known.     

Solution of the Hamiltonian problem for self-complementary graphs

A graph G is said to be highly constricted if there exists a nonempty subset S of vertices such that (i) G ? S has more than |S| components, (ii) S induces the complete graph, and (iii) for every u ∈ S and v ? S, we have d_G(u) > d_G(v), where d_G(u) denotes the degree of u in G. In this paper it is shown that a non-hamiltonian self-complementary graph G of order p is highly constricted, unless p = 4N and G is a particular graph $\text{G}{}^1\text{(4N)}$. It is also proved that if G is a self-complementary graph of order p(≥8) and π its degree sequence, then G is pancyclic if π has a realization with a hamiltonian cycle, and G has a 2-factor if π has a realization with a 2-factor, unless p = 4N and $\text{G = G}{}^1\text{(4N)}$.     

A unique exchange property for bases

We define the concept of unique exchange on a sequence (X₁,…, X_m) of bases of a matroid M as an exchange of x ? X_i for y ? X_j such that y is the unique element of X_j which may be exchanged for x so that (X_i ? {x}) ∪ {y} and (X_j ? {y}) ∪ {x} are both bases. Two sequences X and Y are compatible if they are on the same multiset. Let UE(1) [UE(2)] denote the class of matroids such that every pair of compatible basis sequences X and Y are related by a sequence of unique exchanges [unique exchanges and permutations in the order of the bases]. We similarly define UE(3) by allowing unique subset exchanges. Then UE(1),UE(2), and UE(3) are hereditary classes (closed under minors) and are self-dual (closed under orthogonality). UE(1) equals the class of series-parallel networks, and UE(2) and UE(3) are contained in the class of binary matroids. We conjecture that UE(2) contains the class of unimodular matroids, and prove a related partial result for graphic matroids. We also study related classes of matroids satisfying transitive exchange, in order to gain information about excluded minors of UE(2) and UE(3). A number of unsolved problems are mentioned.     

Réalisation ℓ-adique des motifs mixtes

We provide an integral ?-adic realization functor for the geometrical mixed motives of Voevodsky over a noetherian separated scheme and derive in some case a moderate realization functor. We prove that our realization functor is the same up to isomorphism as the one constructed by A. Huber for rational mixed motives over a ground field of characteristic zero. To cite this article: F. Ivorra, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Special Lagrangian curvature

We define the notion of special Lagrangian curvature, showing how it may be interpreted as an alternative higher dimensional generalisation of two dimensional Gaussian curvature. We obtain first a local rigidity result for this curvature when the ambient manifold has negative sectional curvature. We then show how this curvature relates to the canonical special Legendrian structure of spherical subbundles of the tangent bundle of the ambient manifold. This allows us to establish a strong compactness result. In the case where the special Lagrangian angle equals (n ? 1)π/2, we obtain compactness modulo a unique mode of degeneration, where a sequence of hypersurfaces wraps ever tighter round a geodesic.     

A chain of evolution algebras

We introduce a notion of chain of evolution algebras. The sequence of matrices of the structural constants for this chain of evolution algebras satisfies an analogue of Chapman-Kolmogorov equation. We give several examples (time homogenous, time non-homogenous, periodic, etc.) of such chains. For a periodic chain of evolution algebras we construct a continuum set of non-isomorphic evolution algebras and show that the corresponding discrete time chain of evolution algebras is dense in the set. We obtain a criteria for an evolution algebra to be baric and give a concept of a property transition. For several chains of evolution algebras we describe the behavior of the baric property depending on the time. For a chain of evolution algebras given by the matrix of a two-state evolution we define a baric property controller function and under some conditions on this controller we prove that the chain is not baric almost surely (with respect to Lebesgue measure). We also construct examples of the almost surely baric chains of evolution algebras. We show that there are chains of evolution algebras such that if it has a unique (resp. infinitely many) absolute nilpotent element at a fixed time, then it has unique (resp. infinitely many) absolute nilpotent element any time; also there are chains of evolution algebras which have not such property. For an example of two dimensional chain of evolution algebras we give the full set of idempotent elements and show that for some values of parameters the number of idempotent elements does not depend on time, but for other values of parameters there is a critical time t_c such that the chain has only two idempotent elements if time t?t_c and it has four idempotent elements if time t<t_c.     

Bessel sequences of exponentials on fractal measures

Jorgensen and Pedersen have proven that a certain fractal measure ν has no infinite set of complex exponentials which form an orthonormal set in L²(ν). We prove that any fractal measure μ obtained from an affine iterated function system possesses a sequence of complex exponentials which forms a Riesz basic sequence, or more generally a Bessel sequence, in L²(μ) such that the frequencies have positive Beurling dimension.     

p-Adic model of quantum mechanics and quantum channels

A p-adic realization of the standard statistical model of quantum mechanics is constructed. Within this realization, a p-adic linear bosonic channel is defined, and its properties are analyzed. In particular, a criterion for the existence of a linear Gaussian bosonic channel is obtained, and its explicit construction is described. It is shown that the p-adic Gaussian bosonic channels possess an additivity property.     

Numerical algorithm for solving the matrix equation AX + X* B = C

An algorithm of the Bartels-Stewart type for solving the matrix equation AX + X*B = C is suggested. By applying the QZ-algorithm to the original equation, it is transformed into an equation of the same type with triangular matrix coefficients A and B. The resulting matrix equation is equivalent to the sequence of a system of linear equations with a smaller order of the coefficients of the desired solution. Using numerical examples, the authors simulate a situation where the conditions of a unique solution are “almost” violated. Deterioration of the calculated solutions is in this case followed.     

Stationary probability measures and topological realizations

We establish the generic inexistence of stationary Borel probability measures for aperiodic Borel actions of countable groups on Polish spaces. Using this, we show that every aperiodic continuous action of a countable group on a compact Polish space has an invariant Borel set on which it has no σ-compact realization.     

The pointwise convergence of p-adic Mbius maps

The convergence of linear fractional transformations is an important topic in mathematics.We study the pointwise convergence of p-adic Mbius maps,and classify the possibilities of limits of pointwise convergent sequences of Mbius maps acting on the projective line P1(C p),where C p is the completion of the algebraic closure of Q p.We show that if the set of pointwise convergence of a sequence of p-adic Mbius maps contains at least three points,the sequence of p-adic Mbius maps either converges to a p-adic Mbius map on the projective line P1(C p),or converges to a constant on the set of pointwise convergence with one unique exceptional point.This result generalizes the result of Piranian and Thron(1957)to the non-archimedean settings.