Invariant Computation in a Poset

Kong and Ribemboim (1994) define for every poset P a sequence P = D⁰(P), D(P), D²(P), D³(P)… of posets, where Dⁱ(P) = D(D^i??1(P)) consists of all maximal antichains of D^i??1(P). They prove that for a finite poset P, there exists an integer i ≥?0 such that Dⁱ(P) is a chain. In this paper, for every finite poset P, we show how to calculate the smallest integer i for which Dⁱ(P) is a chain.

     

On the number of solutions of the generalized Ramanujan-Nagell equation D1X2 + DM2 = 2N+2

Let D₁, D₂ be coprime odd integers with min (D₁, D₂) > 1, and let N (D₁, D₂) denote the number of positive integer solutions (x, m, n) of the equation D₁x²+D^m₂ = 2ⁿ⁺². In this paper, we prove that N (D₁, D₂) ≤ 2 except for N (3, 5) = N (5, 3) = 4 and N (13, 3) = N (31, 97) = 3.     

Error bounds for the perturbation of the Drazin inverse under some geometrical conditions

This paper studies the Drazin inverse for perturbed matrices. For that, given a square matrix A, we consider and characterize the class of matrices B with index s such that , and , where and denote the null space and the range space of a matrix A, respectively, and A^D denote the Drazin inverse of A. Then, we provide explicit representations for B^D and BB^D, and upper bounds for the relative error B^D-A^D/A^D and the error BB^D-AA^D. A numerical example illustrates that the obtained bounds are better than others given in the literature.     

Antimagic orientations of even regular graphs

A labeling of a digraph D with m arcs is a bijection from the set of arcs of D to . A labeling of D is antimagic if no two vertices in D have the same vertex-sum, where the vertex-sum of a vertex for a labeling is the sum of labels of all arcs entering u minus the sum of labels of all arcs leaving u. Motivated by the conjecture of Hartsfield and Ringel from 1990 on antimagic labelings of graphs, Hefetz, Mütze, and Schwartz [On antimagic directed graphs, J. Graph Theory 64 (2010) 219–232] initiated the study of antimagic labelings of digraphs, and conjectured that every connected graph admits an antimagic orientation, where an orientation D of a graph G is antimagic if D has an antimagic labeling. It remained unknown whether every disjoint union of cycles admits an antimagic orientation. In this article, we first answer this question in the positive by proving that every 2-regular graph has an antimagic orientation. We then show that for any integer , every connected, 2d-regular graph has an antimagic orientation. Our technique is new.     

On the Spectral Flow of Families of Dirac Operators with Constant Symbol

We consider families of generalized Dirac operators D_t with constant principal symbol and constant essential spectrum such that the endpoints are gauge equivalent, i.e., D₁ = W*D₀W. The spectral flow un any gap in the essential spectrum we express as the Fredholm index of 1 + (W - 1)P where P is the spectral projection on the interval d, ∞) with respect to D₀ and d is in the gap. We reduce the computation of this index to the Atiyah-Singer index theorem for elliptic pseudodifferential operators. We find an invariant of the Riemannian geometry for odd dimensional spin manifolds estimating the length of gaps in the spectrum of the Dirac operator.     

On the restricted arc-connectivity of s-geodetic digraphs

For a strongly connected digraph D the minimum ,cardinality of an arc-cut over all arc-cuts restricted arc-connectivity λ′（D） is defined as the S satisfying that D - S has a non-trivial strong component D1 such that D - V（D1） contains an arc. Let S be a subset of vertices of D. We denote by w＋（S） the set of arcs uv with u ∈ S and v S, and by w-（S） the set of arcs uv with u S and v ∈ S. A digraph D = （V, A） is said to be λ′-optimal if λ′（D） =ξ′（D）, where ξ′（D） is the minimum arc-degree of D defined as ξ（D） = min {ξ′（xy） ： xy ∈ A}, and ξ′（xy） = min（｜ω＋（{x,y}）｜, ｜w-（{x,y}）｜, ｜w＋（x） ∪ w- （y） ｜, ｜w- （x） ∪ω＋ （y）｜}. In this paper a sufficient condition for a s-geodetic strongly connected digraph D to be λ′-optimal is given in terms of its diameter. Furthermore we see that the h-iterated line digraph Lh（D） of a s-geodetic digraph is λ′-optimal for certain iteration h.     

A Criterion for the Triviality of G(D) and Its Applications to the Multiplicative Structure of D

Let D be an F-central division algebra of index n. Here we present a criterion for the triviality of the group G(D) = D*/Nrd _D/F (D*)D′ and thus generalizing various related results published recently. To be more precise, it is shown that G(D) = 1 if and only if SK ₁(D) = 1 and F ^*2 = F ^*2n . Using this, we investigate the role of some particular subgroups of D* in the algebraic structure of D. In this direction, it is proved that a division algebra D of prime index is a symbol algebra if and only if D* contains a non-abelian nilpotent subgroup. More applications of this criterion including the computation of G(D) and the structure of maximal subgroups of D* are also investigated     

On functions with one‐dimensional holomorphic extension property in circular domains

In this paper we consider continuous functions given on the boundary of a circular bounded domain D in , , and having the one‐dimensional holomorphic extension property along family of complex lines, passing through a finite number of points of D. We study the problem of existence of holomorphic extension of such functions into D.     

The finite quotients of the multiplicative group of a division algebra of degree 3 are solvable

LetD be a finite dimensional division algebra. It is known that in a variety of cases, questions about the normal subgroup structure ofD ^x (the multiplicative group ofD) can be reduced to questions about finite quotients ofD ^x. In this paper we prove that when deg(D)=3, finite quotients ofD ^x are solvable. the proof uses Wedderburn’s Factorization Theorem. Partially supported by grant no. 427-97-1 from the Israeli Science Foundation and by grant no. 6782-1-95 from the Israeli Ministry of Science and Art.     

Flag-transitive point-primitive 2-（v,k,4） symmetric designs and two dimensional classical groups

Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ⊴ G ≤ Aut(X) where X ≅ PSL ₂(q). Then D is a 2-(15, 8, 4) symmetric design with X = PSL ₂(9) and X _x = PGL ₂(3) where x is a point of D.     

The connectivity of large digraphs and graphs

This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order n, minimum degree δ, maximum degree Δ, diameter D, and a new parameter l_pi;, 0 ≤ π ≤ δ ? 2, related with the number of short paths (in the case of graphs l₀ = ?(g ? 1)/2? where g stands for the girth). For instance, let G = (V,A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n ≤ n(Δ, D) = 1 + Δ + Δ ² + … + Δ^D (Moore bound). As the main results it is shown that, if κ and λ denote respectively the connectivity and arc-connectivity of G, . Analogous results hold for graphs. © 1993 John Wiley & Sons, Inc.     

Semistar-Krull and valuative dimension of integral domains

Given a stable semistar operation of finite type ⋆ on an integral domain D, we show that it is possible to define in a canonical way a stable semistar operation of finite type ⋆[X] on the polynomial ring D[X], such that, if n := ⋆-dim(D), then n+1 ≤ ⋆[X]-dim(D[X]) ≤ 2n+1. We also establish that if D is a ⋆-Noetherian domain or is a Prüfer ⋆-multiplication domain, then ⋆[X]-dim(D[X]) = ⋆- dim(D)+1. Moreover we define the semistar valuative dimension of the domain D, denoted by ⋆-dim _v (D), to be the maximal rank of the ⋆-valuation overrings of D. We show that ⋆-dim _v (D) = n if and only if ⋆[X ₁, . . . , X _n ]-dim(D[X ₁, . . . , X _n ]) = 2n, and that if ⋆-dim _v (D) < ∞ then ⋆[X]-dim _v (D[X]) = ⋆-dim _v (D) + 1. In general ⋆-dim(D) ≤ ⋆-dim _v (D) and equality holds if D is a ⋆-Noetherian domain or is a Prüfer ⋆-multiplication domain. We define the ⋆-Jaffard domains as domains D such that ⋆-dim(D) < ∞ and ⋆-dim(D) = ⋆-dim _v (D). As an application, ⋆-quasi-Prüfer domains are characterized as domains D such that each (⋆, ⋆′)-linked overring T of D, is a ⋆′-Jaffard domain, where ⋆′ is a stable semistar operation of finite type on T. As a consequence of this result we obtain that a Krull domain D, must be a w _D -Jaffard domain.     

Diameter increase caused by edge deletion

We consider the following problem: Given positive integers k and D, what is the maximum diameter of the graph obtained by deleting k edges from a graph G with diameter D, assuming that the resulting graph is still connected? For undirected graphs G we prove an upper bound of (k + 1)D and a lower bound of (k + 1)D ? k for even D and of (k + 1)D ? 2k + 2 for odd D ? 3. For the special cases of k = 2 and k = 3, we derive the exact bounds of 3D ? 1 and 4D ? 2, respectively. For D = 2 we prove exact bounds of k + 2 and k + 3, for k ? 4 and k = 6, and k = 5 and k ? 7, respectively. For the special case of D = 1 we derive an exact bound on the resulting maximum diameter of order θ(√k). For directed graphs G, the bounds depend strongly on D: for D = 1 and D = 2 we derive exact bounds of θ(√k) and of 2k + 2, respectively, while for D ? 3 the resulting diameter is in general unbounded in terms of k and D. Finally, we prove several related problems NP-complete.     

Null ideals and spanning ranks of matrices,II

Suppose R is an integral domain and A ∈ M _{n × n}(R) \{O}. If D is a spanning rank partner of A, then precisely one of the following three relationships holds: N _A = N _D N _A = XN _D or XN _A = N _D. Here X is an indeterminate and N _A(N _D) denotes the null ideal of A(D) in R[X]. There are easy examples of A and D for which N _A = N _D and N _A = XN _D. In this paper, we give an example where XN _A = N _D. We give sharper versions of the theorem for n ≤ 4.     

Bifurcation of the positive solutions to Henon equation

Three algorithms based on the bifurcation method is applied to solving the D₄ symmetric positive solutions to the boundary value problem of = Henon equation. Taking r in Henon equation as a bifurcation parameter, the D₄ – ∑_d (D₄ – ∑₁, D₄ – ∑₂) symmetry-breaking bifurcation point on the branch of the D₄ symmetric positive solutions is found via the extended systems. Finally, ∑_d (∑₁, ∑₂) symmetric positive solutions = are computed by the branch switching method based on the Liapunov-Schmidt reduction. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Existence and Construction of Tight Fourth Order Quadrature Rules for the Sphere

We study the so-called tight quadrature rules for polynomials of degree 4 on the unit sphere S ^D-1 and present precise formulae for the first 6 components of the nodes in terms of the parameter u := . In particular, we reobtain the well-known necessary condition for the existence of such rules saying that u has to be an odd integer and we sharpen it under an additional assumption.As a constructive application, two explicit tight fourth order quadrature rules for the case D = 7 are given.     

Bounds of the Ideal Class Numbers of Real Quadratic Function Fields

The theory of continued fractions of functions is used to give a lower bound for class numbers h(D) of general real quadratic function fields K=k(D)over k=Fq(T)．For five series of real quadratic function fields K,the bounds of h(D)are given more explicitly,e．g.,if D=F^2 C．then h(D)≥degF／degP;if D=(SG)^2 cS．then h(D)≥degS／degP;if D=(A^m a)^2 A,then h(D)≥degA／degP,where P is an irreducible polynomial splitting in K,c∈Fq．In addition,three types of quadratic function fields K are found to have ideal class numbers bigger than one．     

Holomorphic Dependence of the Heins Map

Let D be a bounded convex domain and Hol _c (D,D) the set of holomorphic maps from D to C ⁿ with image relatively compact in D. Consider Hol _c (D,D) as a open set in the complex Banach space H ^∞ _n (D) of bounded holomorphic maps from D to C ⁿ . We show that the map τ: Hol _c (D,D) → D (called the Heins map for D equals to the unit disc of C) which associates to ? ∈ Hol _c (D,D) its unique fixed point τ? ∈ D is holomorphic and its differential is given by dτ_?(v) = (Id-df_τ(?))^?1 v(τ(?)) for v ∈ H ^∞ _n (D).     

On the mean lattice point discrepancy of a convex disc

For a convex planar domain D \cal {D} , with smooth boundary of finite nonzero curvature, we consider the number of lattice points in the linearly dilated domain t D t \cal {D} . In particular the lattice point discrepancy P_D(t) P_{\cal {D}}(t) (number of lattice points minus area), is investigated in mean-square over short intervals. We establish an asymptotic formula for¶¶ ò_{T - L}^{T + L}(P_D(t))²dt \int\limits_{T - \Lambda}^{T + \Lambda}(P_{\cal {D}}(t))^2\textrm{d}t ,¶¶ for any L = L(T) \Lambda = \Lambda(T) growing faster than logT.     

Iterating the branching operation on a directed graph

The branching operation D, defined by Propp, assigns to any directed graph G another directed graph D(G) whose vertices are the oriented rooted spanning trees of the original graph G. We characterize the directed graphs G for which the sequence δ(G) = (G, D(G), D²(G),…) converges, meaning that it is eventually constant. As a corollary of the proof we get the following conjecture of Propp: for strongly connected directed graphs G, δ(G) converges if and only if D²(G) = D(G). © 1997 John Wiley & Sons, Inc.