On the factor-web $$ {\boldsymbol{\bar{ W}}} $$ ( ρ, r,r) of the three-web W( r,r, r)

The notion of the factor-web [`(W)] \bar{W} (ρ, r, r) (1 ≤ ρ < r) is defined for the three-web W(r, r, r) formed on a 2r-dimensional differentiable manifold by three r-dimensional smooth foliations. Embedding of the factor-web in the initial web W(r, r, r) is constructed. This construction is a well-known geometric analog of the canonical extension of a Lie group of transformations to its parameter group.     

Diffusions réfléchies réversibles dégénérées

On a domain D in ^d, for a smooth enough probability density and a diffusion matrix which can degenerate, we construct the law Q ^s of a (x)d -symmetric reflecting process in D with matrix . Therefore, we use the associated Dirichlet form and a sequence of approximating processes already used by Pardoux and R. Williams in [23]. Under mild conditions on the boundary ofD (finite Minkowski content), we prove that Q ^s is the law of a semi-martingale and provide its decomposition. Comparing with the decomposition in additive functionals, we conclude that the process is reflected in the conormal direction ^* n where n denotes Chen's normal (cf [10]), that is, the reflection direction of the Brownian motion in Kuramochi compactification.     

多目标规划的r—有效解和r—最优

本文引入有限维向量空间的r-序类概念,讨论了它们的基本性质。在此基础上,定义了多目标规划的r-有效解和r-最优解,研究了它们与其它有关解之间的关系。     

Integralgleichungen für einige Randwertprobleme für Gebiete mit Ecken

Summary Concerning conformal mapping and problems of the theory of elasticity, the classical integral equations are modified in order to treat the cases of not smooth boundary curves. As the kernels are still bounded, no difficulties of numerical computation arise.     

Lokale Konvergenzbedingugen für trigonometrische Reihen und für Potenzreihen

Ohne ZusammenfassungHerrnFriedrich Lösch zum 60. Geburstag am 10. Dezember 1963 gewidmetDie Arbeit wurde unterstützt durch den National Research Council of Canada, als der Verfasser an der University of Western Ontario war.     

Le régulateur p-adique

For all $n\in {\mathbf{N}}^1$, we define a p-adic regulator $R_p:K_{2n+1}({\mathbf{Q}}_p)\to {\mathbf{Q}}_p$ given by an explicit formula and we show that $R_p$ is non-trivial for $n=1$. The main ideas come from a Note published in 2000 for the transcendental case. To cite this article: N. Hamida, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Existenzfragen für Strahlensysteme

Ohne ZusammenfassungHerrn Professor Dr.Wolfgang Haack zum 60. Geburtstag gewidmet     

Marginalprobleme für Funktionen

Ohne Zusammenfassung     

Varför Tunneldioder?

In the last two years the electronic industry has shown a great interest in tunnel diodes. This article gives a short explanation of the basic effect and summarizes the more important features of the device. The general fabrication technique is outlined, and some associated problems are discussed.     

Rational realization of the minimum ranks of nonnegative sign pattern matrices

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set {+,?, 0} ({+, 0}, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of A. Using a correspondence between sign patterns with minimum rank r ≥ 2 and point-hyperplane configurations in R^r?1 and Steinitz’s theorem on the rational realizability of 3-polytopes, it is shown that for every nonnegative sign pattern of minimum rank at most 4, the minimum rank and the rational minimum rank are equal. But there are nonnegative sign patterns with minimum rank 5 whose rational minimum rank is greater than 5. It is established that every d-polytope determines a nonnegative sign pattern with minimum rank d + 1 that has a (d + 1) × (d + 1) triangular submatrix with all diagonal entries positive. It is also shown that there are at most min{3m, 3n} zero entries in any condensed nonnegative m × n sign pattern of minimum rank 3. Some bounds on the entries of some integer matrices achieving the minimum ranks of nonnegative sign patterns with minimum rank 3 or 4 are established.     

A Probabilistic Characterization of the Dominance Order on Partitions

We present a probabilistic characterization of the dominance order on partitions. Let ν be a partition and Y _ν its Ferrers diagram, i.e. a stack of rows of cells with row i containing ν _i cells. Let the cells of Y _ν be filled with independent and identically distributed draws from the random variable X = B i n(r, p) with r ≥ 1 and p ∈ (0, 1). Given j, t ≥ 0, let P(ν, j, t) be the probability that the sum of all the entries in Y _ν is j while the sum of the entries in each row of Y _ν is no more than t. It is shown that if ν and μ are two partitions of n, ν dominates μ if and only if P(ν, j, t) ≤ P(μ, j, t) for all j, t ≥ 0. It is shown that the same result holds if X is any log-concave integer valued random variable with {i : P(X = i) > 0} = {0, 1,…,r} for some r ≥ 1.     

Turán-Type Results for Complete <Emphasis Type="Italic">h</Emphasis>-Partite Graphs in Comparability and Incomparability Graphs

We consider an h-partite version of Dilworth’s theorem with multiple partial orders. Let P be a finite set, and let <₁,...,< _r be partial orders on P. Let G(P, <₁,...,< _r ) be the graph whose vertices are the elements of P, and x, y ∈ P are joined by an edge if x< _i y or y< _i x holds for some 1 ≤ i ≤ r. We show that if the edge density of G(P, <₁, ... , < _r ) is strictly larger than 1 ? 1/(2h ? 2) ^r , then P contains h disjoint sets A ₁, ... , A _h such that A ₁ < _j ... < _j A _h holds for some 1 ≤ j ≤ r, and |A ₁| = ... = |A _h | = Ω(|P|). Also, we show that if the complement of G(P, <) has edge density strictly larger than 1 ? 1/(3h ? 3), then P contains h disjoint sets A ₁, ... , A _h such that the elements of A _i are incomparable with the elements of A _j for 1 ≤ i < j ≤ h, and |A ₁| = ... = |A _h | = |P|^1?o(1). Finally, we prove that if the edge density of the complement of G(P, <₁, <₂) is α, then there are disjoint sets A, B ? P such that any element of A is incomparable with any element of B in both <₁ and <₂, and |A| = |B| > n ^1?γ(α), where γ(α) → 0 as α → 1. We provide a few applications of these results in combinatorial geometry, as well.     

On Tverberg partitions

A theorem of Tverberg from 1966 asserts that every set X ? ? ^d of n = T(d, r) = (d + 1)(r ? 1) + 1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a ₁,..., a _r satisfying n = a ₁ + ··· + a _r ), in which the parts a _i correspond to the number of points in every subset. In this paper, we prove that for any partition of n where the parts satisfy a _i ≤ d + 1 for all i = 1,..., r, there exists a set X ? ? of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a ₁,..., a _r .     

Multiple commutator formulas for unitary groups

Let (A,Λ) be a formring such that A is quasi-finite R-algebra (i.e., a direct limit of module finite algebras) with identity. We consider the hyperbolic Bak’s unitary groups GU(2n, A, Λ), n ≥ 3. For a form ideal (I, Γ) of the form ring (A, Λ) we denote by EU(2n, I, Γ) and GU(2n, I, Γ) the relative elementary group and the principal congruence subgroup of level (I, Γ), respectively. Now, let (I _i , Γ _i ), i = 0,...,m, be form ideals of the form ring (A, Λ). The main result of the present paper is the following multiple commutator formula: [EU(2n, I ₀, Γ ₀),GU(2n, I ₁, Γ ₁), GU(2n, I ₂, Γ ₂),..., GU(2n, I _m , Γ _m )] =[EU(2n, I ₀, Γ ₀), EU(2n, I ₁, Γ ₁), EU(2n, I ₂, Γ ₂),..., EU(2n, I _m , Γ _m )], which is a broad generalization of the standard commutator formulas. This result contains all previous results on commutator formulas for classicallike groups over commutative and finite-dimensional rings.     

Centralizers of generalized skew derivations on multilinear polynomials

Let R be a prime ring of characteristic different from 2, let Q be the right Martindale quotient ring of R, and let C be the extended centroid of R. Suppose that G is a nonzero generalized skew derivation of R and f(x ₁,..., x _n ) is a noncentral multilinear polynomial over C with n noncommuting variables. Let f(R) = {f(r ₁,..., r _n ): r _i ∈ R} be the set of all evaluations of f(x ₁,..., x _n ) in R, while A = {[G (f(r ₁,..., r _n )), f(r ₁,..., r _n )]: r _i ∈ R}, and let C _R (A) be the centralizer of A in R; i.e., C _R (A) = {a ∈ R: [a, x] = 0, ? _x ∈ A }. We prove that if A ≠ (0), then C _R (A) = Z(R).     

Extrapolation in Grand Lebesgue Spaces with <Emphasis Type="Italic">A</Emphasis>∞ Weights

Results on extrapolation withA∞ weights in grand Lebesgue spaces are obtained. Generally, these spaces are defined with respect to the productmeasure μ₁ ×· · ·×μ_n onX₁ ×· · ·×X_n, where (X_i, d_i, μ_i), i = 1,..., n, are spaces of homogeneous type. As applications of the obtained results, new one-weight estimates with A_∞ weights for operators of harmonic analysis are derived.     

Independence numbers of random subgraphs of distance graphs

We consider the distance graph G(n, r, s), whose vertices can be identified with r-element subsets of the set {1, 2,..., n}, two arbitrary vertices being joined by an edge if and only if the cardinality of the intersection of the corresponding subsets is s. For s = 0, such graphs are known as Kneser graphs. These graphs are closely related to the Erd?s–Ko–Rado problem and also play an important role in combinatorial geometry and coding theory. We study some properties of random subgraphs of G(n, r, s) in the Erd?s–Rényi model, in which every edge occurs in the subgraph with some given probability p independently of the other edges. We find the asymptotics of the independence number of a random subgraph of G(n, r, s) for the case of constant r and s. The independence number of a random subgraph is Θ(log₂n) times as large as that of the graph G(n, r, s) itself for r ≤ 2s + 1, while for r > 2s + 1 one has asymptotic stability: the two independence numbers asymptotically coincide.     

The maximum and minimum degree of the random <Emphasis Type="Italic">r</Emphasis>-uniform <Emphasis Type="Italic">r</Emphasis>-partite hypergraphs

In this paper we consider the random r-uniform r-partite hypergraph model H(n ₁, n ₂, ···, n _r; n, p) which consists of all the r-uniform r-partite hypergraphs with vertex partition {V ₁, V ₂, ···, V _r} where |V _i| = n _i = n _i(n) (1 ≤ i ≤ r) are positive integer-valued functions on n with n ₁ +n ₂ +···+n _r = n, and each r-subset containing exactly one element in V _i (1 ≤ i ≤ r) is chosen to be a hyperedge of H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) with probability p = p(n), all choices being independent. Let

$${\Delta _{{V_1}}} = {\Delta _{{V_1}}}\left( H \right)$$

and

$${\delta _{{V_1}}} = {\delta _{{V_1}}}\left( H \right)$$

be the maximum and minimum degree of vertices in V ₁ of H, respectively;

$${X_{d,{V_1}}} = {X_{d,{V_1}}}\left( H \right),{Y_{d,{V_1}}} = {Y_{d,{V_1}}}\left( H \right)$$

,

$${Z_{d,{V_1}}} = {Z_{d,{V_1}}}\left( H \right)and{Z_{c,d,{V_1}}} = {Z_{c,d,{V_1}}}\left( H \right)$$

be the number of vertices in V ₁ of H with degree d, at least d, at most d, and between c and d, respectively. In this paper we obtain that in the space H(n ₁, n ₂, ···, n _r; n, p),

$${X_{d,{V_1}}},{Y_{d,{V_1}}},{Z_{d,{V_1}}}and{Z_{c,d,{V_1}}}$$

all have asymptotically Poisson distributions. We also answer the following two questions. What is the range of p that there exists a function D(n) such that in the space H(n ₁, n ₂, ···, n _r; n, p),

$$\mathop {\lim }\limits_{n \to \infty } P\left( {{\Delta _{{V_1}}} = D\left( n \right)} \right) = 1$$

? What is the range of p such that a.e., H _p ∈ H (n ₁, n ₂, ···, n _r; n, p) has a unique vertex in V ₁ with degree

$${\Delta _{{V_1}}}\left( {{H_p}} \right)$$

? Both answers are p = o (log n ₁/N), where

$$N = \mathop \prod \limits_{i = 2}^r {n_i}$$

. The corresponding problems on

$${\delta _{{V_i}}}\left( {{H_p}} \right)$$

also are considered, and we obtained the answers are p ≤ (1 + o(1))(log n ₁/N) and p = o (log n ₁/N), respectively.

     

On Lebesgue Measure of Integral Self-Affine Sets

Let A be an expanding integer n×n matrix and D be a finite subset of ? ⁿ . The self-affine set T=T(A,D) is the unique compact set satisfying the equality \(A(T)=\bigcup_{d\in D}(T+d)\). We present an effective algorithm to compute the Lebesgue measure of the self-affine set T, the measure of the intersection T∩(T+u) for u∈? ⁿ , and the measure of the intersection of self-affine sets T(A,D ₁)∩T(A,D ₂) for different sets D ₁, D ₂?? ⁿ .