Displaying similar documents to “ Invariant graphs of functions for the mean-type mappings ”

Central limit theorems for linear spectral statistics of large dimensional F-matrices

Shurong Zheng (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

In many applications, one needs to make statistical inference on the parameters defined by the limiting spectral distribution of an matrix, the product of a sample covariance matrix from the independent variable array ( )×1 and the inverse of another covariance matrix from the independent variable array ( )×2. Here, the two variable arrays are assumed to either both real or both complex. It helps to find the asymptotic distribution of the relevant parameter...

On the number of dissimilar pfaffian orientations of graphs

Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S.R. Murty (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

A subgraph of a graph is if has a perfect matching. An orientation of is if, for every conformal even circuit , the number of edges of whose directions in  agree with any prescribed sense of orientation of is odd. A graph is if it has a Pfaffian orientation. Not every graph is Pfaffian. However, if has a Pfaffian orientation , then the determinant of the adjacency matrix of is the square of the number of perfect matchings of . (See the book by Lovász and Plummer [. Annals...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () =  (||) to multiple integrals ∫ ((), |()|)  on a  ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a  : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every  or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...