Let Ω \subset \mathbb{R}^{n} be a domain and let α < n − 1. We prove the Concentration-Compactness Principle for the embedding of the space W_{0}^{1}L^{n} log^{\alpha } L(Ω) into an Orlicz space corresponding to a Young function which behaves like (t^{n/n-1-\alpha }) for large t. We also give the result for the embedding into multiple exponential spaces. Our main result is Theorem 1.6 where we show that if one passes to unbounded domains, then, after the usual modification of the integrand in the Moser functional, the statement of the Concentration-Compactnes Principle is very similar to the statement in the case of a bounded domain. In particular, in the case of a nontrivial weak limit the borderline exponent is still given by the formula P: = \left( {1 - \left\| {\Phi (|\nabla u|)} \right\|_{L^1 (\mathbb{R}^n )} } \right)^{ - 1/(n - 1)} ., Robert Černý., and Obsahuje seznam literatury
The eigenvalues of graphs are related to many of its combinatorial properties. In his fundamental work, Fiedler showed the close connections between the Laplacian eigenvalues and eigenvectors of a graph and its vertex-connectivity and edge-connectivity. We present some new results describing the connections between the spectrum of a regular graph and other combinatorial parameters such as its generalized connectivity, toughness, and the existence of spanning trees with bounded degree., Sebastian M. Cioabă, Xiaofeng Gu., and Obsahuje seznam literatury
We investigate how one can detect the dualizing property for a chain complex over a commutative local Noetherian ring R. Our focus is on homological properties of contracting endomorphisms of R, e.g., the Frobenius endomorphism when R contains a field of positive characteristic. For instance, in this case, when R is F-finite and C is a semidualizing R-complex, we prove that the following conditions are equivalent: (i) C is a dualizing R-complex; (ii) C\sim RHom_{R}(^{n}R,C) for some n > 0; (iii) G_{C}-dim^{n}R < ∞ and C is derived RHom_{R}(^{n}R,C)-reflexive for some n > 0; and (iv) G_{C}-dim^{n}R < ∞ for infinitely many n > 0., Saeed Nasseh, Sean Sather-Wagstaff., and Obsahuje seznam literatury
We extend Rump’s verified method (S.Oishi, K.Tanabe, T.Ogita, S.M.Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for computing the Moore-Penrose inverse., Yunkun Chen, Xinghua Shi, Yimin Wei., and Obsahuje seznam literatury
We study the presence of copies of ln p ’s uniformly in the spaces 2(C[0, 1],X) and 1(C[0, 1],X). By using Dvoretzky’s theorem we deduce that if X is an infinite- dimensional Banach space, then 2(C[0, 1],X) contains p2-uniformly copies of ln∞’s and 1(C[0, 1],X) contains -uniformly copies of ln 2 ’s for all > 1. As an application, we show that if X is an infinite-dimensional Banach space then the spaces 2(C[0, 1],X) and 1(C[0, 1],X) are distinct, extending the well-known result that the spaces 2(C[0, 1],X) and N(C[0, 1],X) are distinct., Dumitru Popa., and Seznam literatury
An n × n sign pattern A is said to be potentially nilpotent if there exists a nilpotent real matrix B with the same sign pattern as A. Let D_{n,r} be an n × n sign pattern with 2 \geqslant r \geqslant n such that the superdiagonal and the (n, n) entries are positive, the (i, 1) (i = 1,..., r) and (i, i − r + 1) (i = r + 1,..., n) entries are negative, and zeros elsewhere. We prove that for r \geqslant 3 and n \geqslant 4r − 2, the sign pattern D_{n,r} is not potentially nilpotent, and so not spectrally arbitrary., Yanling Shao, Yubin Gao, Wei Gao., and Obsahuje seznam literatury
This paper is devoted to the study of matrix elements of irreducible representations of the enveloping deformed Heisenberg algebra with reflection, motivated by recurrence relations satisfied by hypergeometric functions. It is shown that the matrix elements of a suitable operator given as a product of exponential functions are expressed in terms of d-orthogonal polynomials, which are reduced to the orthogonal Meixner polynomials when d = 1. The underlying algebraic framework allowed a systematic derivation of the recurrence relations, difference equation, lowering and rising operators and generating functions which these polynomials satisfy., Fethi Bouzeffour, Hanen Ben Mansour, Ali Zaghouani., and Obsahuje bibliografii
A classical result in number theory is Dirichlet’s theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M.Wright in 1954, we compute the natural density of such numbers where each prime satisfies a congruence condition. As an application, we obtain the density of squarefree n 6 x with k prime factors such that a fixed quadratic equation has exactly 2k solutions modulo n., Neha Prabhu., and Seznam literatury
Let $\Delta_{n,d}$ (resp. $\Delta_{n,d}'$) be the simplicial complex and the facet ideal $I_{n,d}=(x_1\cdots x_d,x_{d-k+1}\cdots
x_{2d-k},\ldots,x_{n-d+1}\cdots x_n)$ (resp. $J_{n,d}=(x_1\cdots x_d,x_{d-k+1}\cdots x_{2d-k},\ldots,x_{n-2d+2k+1}\cdots x_{n-d+2k},x_{n-d+k+1}\cdots x_nx_1\cdots x_k)$). When $d\geq2k+1$, we give the exact formulas to compute the depth and Stanley depth of quotient rings $S/J_{n,d}$ and $S/I_{n,d}^t$ for all $t\geq1$. When $d=2k$, we compute the depth and Stanley depth of quotient rings $S/J_{n,d}$ and $S/I_{n,d}$, and give lower bounds for the depth and Stanley depth of quotient rings $S/I_{n,d}^t$ for all $t\geq1$., Xiaoqi Wei, Yan Gu., and Obsahuje bibliografické odkazy
Erster Theil, Die Theorie der Anschauung oder die Mathematischen Gesetze. Enthaltend die allgemeinen Gesetze der Zahl und die besonderen Gesetze des Raumes, der Zeit, der Kraft, der Neigung und des Triebes, von Hermann Scheffler., KČSN, and Mit 4 Figurentafeln