14,953,413 research outputs found

    Hyperbolicity of the time-like extremal surfaces in minkowski spaces

    Full text link
    In this paper, it is established, in the case of graphs, that time-like extremal surfaces of dimension 1+n1+n in the Minkowski space of dimension 1+n+m1+n+m can be described by a symmetric hyperbolic system of PDEs with the very simple structure (reminiscent of the inviscid Burgers equation)_tW+_j=1nA_j(W)_x_jW=0,      W:  (t,x)R1+nW(t,x)Rn+m+(m+nn), \partial\_t W + \sum\_{j=1}^n A\_j(W)\partial\_{x\_j} W =0,\;\;\;W:\;(t,x)\in\mathbb{R}^{1+n}\rightarrow W(t,x)\in\mathbb{R}^{n+m+\binom{m+n}{n}},where each A_j(W)A\_j(W) is just a (n+m+(m+nn))×(n+m+(m+nn))\big(n+m+\binom{m+n}{n}\big)\times\big(n+m+\binom{m+n}{n}\big) symmetric matrix dependinglinearly on WW

    On the minimal number of critical points of functions on h-cobordisms

    Full text link
    Let (W,M,M'), dim W > 5, be a non-trivial h-cobordism (i.e., the Whitehead torsion of (W,V) is non-zero). We prove that every smooth function f: W --> [0,1], f(M)=0, f(M')=1 has at least 2 critical points. This estimate is sharp: W possesses a function as above with precisely two critical points.Comment: 7 pages, Late

    Construction Of A Rich Word Containing Given Two Factors

    Full text link
    A finite word ww with w=n\vert w\vert=n contains at most n+1n+1 distinct palindromic factors. If the bound n+1n+1 is attained, the word ww is called \emph{rich}. Let \Factor(w) be the set of factors of the word ww. It is known that there are pairs of rich words that cannot be factors of a common rich word. However it is an open question how to decide for a given pair of rich words u,vu,v if there is a rich word ww such that \{u,v\}\subseteq \Factor(w). We present a response to this open question:\\ If w1,w2,ww_1, w_2,w are rich words, m=max{w1,w2}m=\max{\{\vert w_1\vert,\vert w_2\vert\}}, and \{w_1,w_2\}\subseteq \Factor(w) then there exists also a rich word wˉ\bar w such that \{w_1,w_2\}\subseteq \Factor(\bar w) and wˉm2k(m)+2\vert \bar w\vert\leq m2^{k(m)+2}, where k(m)=(q+1)m2(4q10m)log2mk(m)=(q+1)m^2(4q^{10}m)^{\log_2{m}} and qq is the size of the alphabet. Hence it is enough to check all rich words of length equal or lower to m2k(m)+2m2^{k(m)+2} in order to decide if there is a rich word containing factors w1,w2w_1,w_2

    Generalized Moisil-Théodoresco systems and Cauchy integral decompositions

    Get PDF
    Let ℝ0,m+1(s) be the space of s-vectors (0≤s≤m+1) in the Clifford algebra ℝ0,m+1 constructed over the quadratic vector space ℝ0,m+1, let r,p,q∈ℕ with 0≤r≤m+1, 0≤p≤q, and r+2q≤m+1, and let ℝ0,m+1(r,p,q)=∑j=pq⨁ ℝ0,m+1(r+2j). Then, an ℝ0,m+1(r,p,q)-valued smooth function W defined in an open subset Ω⊂ℝm+1 is said to satisfy the generalized Moisil-Théodoresco system of type (r,p,q) if ∂xW=0 in Ω, where ∂x is the Dirac operator in ℝm+1. A structure theorem is proved for such functions, based on the construction of conjugate harmonic pairs. Furthermore, if Ω is bounded with boundary Γ, where Γ is an Ahlfors-David regular surface, and if W is a ℝ0,m+1(r,p,q)-valued Hölder continuous function on Γ, then necessary and sufficient conditions are given under which W admits on Γ a Cauchy integral decomposition W=W++W−
    corecore