Upper bounds on the sum of powers of the degrees of a simple planar graph

For a simple planar graph G and a positive integer k, we prove the upper bound 2(n ? 1)^k + 4^k(n ? 4) + 2·3^k ? 2((δ + 1)^k ? δ^k)(3n ? 6 ? m) on the sum of the kth powers of the degrees of G, where n, m, and δ are the order, the size, and the minimum degree of G, respectively. The bound is tight for all m with 0?3n ? 6 ? m≤?n/2? ? 2 and δ = 3. We also present upper bounds in terms of order, minimum degree, and maximum degree of G. © 2010 Wiley Periodicals, Inc. J Graph Theory 67:112‐123, 2011     

On point-halfspace graphs

The following definition is motivated by the study of circle orders and their connections to graphs. A graphs G is called a point-halfspace graph (in R ^k) provided one can assign to each vertex v ? (G) a point p _v R ^k and to each edge e ? E(G) a closed halfspace H_e ? R ^k so that v is incident with e if and only if p _v ? H_e. Let H ^k denote the set of point-halfspace graphs (in R ^k). We give complete forbidden subgraph and structural characterizations of the classes H ^k for every k. Surprisingly, these classes are closed under taking minors and we give forbidden minor characterizations as well. © 1996 John Wiley & Sons, Inc.     

A bound for wilson's theorem (I)

In 1975, Richard M. Wilson proved: Given any positive integers k ? 3 and λ, there exists a constant v⁰ = v⁰(k, λ) such that v ? B(k,λ) for every integer v ? v⁰ that satisfies λ(v ? 1) ≡ 0(mod k ? 1) and λv(v ? 1) ≡ 0[mod k(k ? 1)]. The proof given by Wilson does not provide an explicit value of v⁰. We try to find such a value v⁰(k, λ). In this article we consider the case λ = 1 and v ≡ 1[mod k(k ? 1)]. We show that: if k ? 3 and v = 1[mod k(k ? 1)] where v > k^kk5, then a B(v,k, 1) exists. © 1995 John Wiley & Sons, Inc.     

About smoothness of solutions of the heat equations in closed,smooth space‐time domains

We consider the probabilistic solutions of the heat equation u = u + f in D, where D is a bounded domain in ?² = {(x¹, x²)} of class C^2k. We give sufficient conditions for u to have k^th‐order continuous derivatives with respect to (x¹, x²) in D? for integers k ≥ 2. The equation is supplemented with C^2k boundary data, and we assume that f ? C^2(k?1). We also prove that our conditions are sharp by examples in the border cases. © 2005 Wiley Periodicals, Inc.     

Coloring Geometric Range Spaces

We study several coloring problems for geometric range-spaces. In addition to their theoretical interest, some of these problems arise in sensor networks. Given a set of points in ?² or ?³, we want to color them so that every region of a certain family (e.g., every disk containing at least a certain number of points) contains points of many (say, k) different colors. In this paper, we think of the number of colors and the number of points as functions of k. Obviously, for a fixed k using k colors, it is not always possible to ensure that every region containing k points has all colors present. Thus, we introduce two types of relaxations: either we allow the number of colors used to increase to c(k), or we require that the number of points in each region increases to p(k).Symmetrically, given a finite set of regions in ?² or ?³, we want to color them so that every point covered by a sufficiently large number of regions is contained in regions of k different colors. This requires the number of covering regions or the number of allowed colors to be greater than k.The goal of this paper is to bound these two functions for several types of region families, such as halfplanes, halfspaces, disks, and pseudo-disks. This is related to previous results of Pach, Tardos, and Tóth on decompositions of coverings.     

Relative Brauer Groups of Function Fields of Curves of Genus One

Abstract

Let Kbe an algebraic function field in one variable over a constant field k. In this paper, we investigate the relative Brauer groups Br(K/k) of Kover kin various cases. When kis a global field, we focus on function fields K = k(C) of genus 1 where Cis the curve of the form y ² = at ⁴ + bwith a, b ∈ k ? {0}, and we describe the Brauer classes in Br(K/k). More precisely, we show that each algebra in Br(K/k) is a quaternion algebra which can be obtained by taking one of a finite number of the x-coordinates of k-rational points on the Jacobian of the curve C. In particular, for the field ? of rational numbers, we determine Br(K/?) precisely in numerous cases and give examples.     

A note on bipartite subgraphs of triangle-free graphs

Let G be a triangle-free graph on n points with m edges and vertex degrees d₁, d₂,…, d_n. Let k be the maximum number of edges in a bipartite subgraph of G. In this note we show that k ? m/2 + Σ √d_i. It follows as a corollary that k ? m/2 + cm^3/4.     

A General Version of the Retract Method for Discrete Equations

We study a problem concerning the compulsory behavior of the solutions of systems of discrete equations u（k ＋ 1） = F（k, u（k））, k ∈ N（a） = {a, a ＋ 1, a ＋ 2 }, a ∈ N,N= {0, 1,... } and F ： N（a） × R^n→R^n. A general principle for the existence of at least one solution with graph staying for every k ∈ N（a） in a previously prescribed domain is formulated. Such solutions are defined by means of the corresponding initial data and their existence is proved by means of retract type approach. For the development of this approach a notion of egress type points lying on the defined boundary of a given domain and with respect to the system considered is utilized. Unlike previous investigations, the boundary can contain points which are not points of egress type, too. Examples are inserted to illustrate the obtained result.     

Problemi al contorno con condizioni omogenee per le equazioni quasi-ellittiche

Summary We are concerned with non-variational boundary value problems, with omogeneus boundary conditions, for linear partial differential equations of quasi-elliptic type in a bounded domain Θ in Rⁿ. It is well known that some of difficulties which arise in treating such problems, in comparison with ? regular ? elliptic problems, are connected with the presence of angular points in Θ: let us point out withB. Pini [32] that ? a bounded domain for which it is possible to assign a correct boundary value problem for a quasi-elliptic but not elliptic equation always has angular points ?. We suppose Θ is a cartesian product of a finite number of open sets and, in order to overcome the difficulties attached to the presence of angular points in Θ, taking as a model the two previous papers[33], [34] devoted to elliptic problems with singular data, we investigate the problem within suitable Sobolev weight spaces, connected with the angular points of Θ and included in the ones we have studied in[35]. Within such spaces we get existence and uniqueness theorems.

---

---

Lavoro eseguito con contributo del C. N. R.

---

Entrata in Redazione il 30 ottobre 1971.     

Fixed points and normal families of quasiregular mappings

LetF be a family of mappingsK-quasiregular in some domainG. We show that if for eachf∈F, there existsk>1 such that thek-th iteratef ^k off has no fixed point, thenF is normal. Moreover, we examine to what extent this result holds if we consider only repelling fixed points, rather than fixed points in general. We also prove thatF is quasinormal, ifF contains only quasiregular mappings that do not have periodic points of some period greater than one inG. This implies that a quasiregular mappingf:ℝ ⁿ with an essential singularity in ∞ has infinitely many periodic points of any period greater than one. These results generalize results of M. Essén, S. Wu, D. Bargmann and W. Bergweiler for holomorphic functions.     

Configurations Maximizing the Number of Pairs of Hamming-Adjacent Lattice Points

The following question is considered: Which sets of k lattice points among the n^d points in a d-dimensional cube of length n maximize the number of pairs of points differing in only one coordinate? It is shown that maximal configurations for any (d, n, k) are obtained by choosing the first k points in a lexicographic ordering of the points by coordinates. Some possible generalizations of the problem are discussed.     

Solutions to the polynomial Dirac equations on unbounded domains in Clifford analysis

In this paper we study polynomial Dirac equation p(??)f = 0 including (?? ? λ)f = 0 with complex parameter λ and ??^kf = 0(k?1) as special cases over unbounded subdomains of ?^{n + 1}. Using the Clifford calculus, we obtain the integral representation theorems for solutions to the equations satisfying certain decay conditions at infinity over unbounded subdomains of ?^{n + 1}. Copyright © 2010 John Wiley & Sons, Ltd.     

Maximal commutative subalgebras of matrix algebras

Maximal commutative subalgebras of the algebra of n by n matrices over a field k very rarely have dimension smaller than n. There is a (B, N)-construction which yields subalgebras of this kind. The Courter's algebra that is of this kind was shown a (B, N)-construction where B is the Schur algebra of size 4 and N = k ⁴. That is, the Courter's algebra is isomorphic to B ? (k ⁴)², the idealization of (k ⁴)². It was questioned how many isomorphism classes can be produced by varying the finitely generated faithful B-module N. In this paper, we will show that the set of all algebras B ? N ² fall into a single isomorphism class, where B is the Schur algebra of size 4 and N a finitely generated faithful B-module.     

On a class of closed prime ideals in H ∞

Gorkin and Mortini introduced the concept of k-hulls, k(x), of points x in M(H ^∞)????D, and studied the ideal structures of H ^∞ and H ^∞ +C. They posed a problem for which x∈ M(H ^∞)????D the set I(k(x)) is a closed prime ideal. In this article, we give a partial answer for sparse points x.     

Stability for the Multi-Dimensional Borg-Levinson Theorem with Partial Spectral Data

We prove a stability estimate related to the multi-dimensional Borg-Levinson theorem of determining a potential from spectral data: the Dirichlet eigenvalues λ _k and the normal derivatives ?φ _k /?ν of the eigenfunctions on the boundary of a bounded domain. The estimate is of Hölder type, and we allow finitely many eigenvalues and normal derivatives to be unknown. We also show that if the spectral data is known asymptotically only, up to O(k ^?α) with α ? 1, then we still have Hölder stability.     

Multiplicity of Continuous Mappings of Domains

We prove that either the proper mapping of a domain of an n-dimensional manifold onto a domain of another n-dimensional manifold of degree k is an interior mapping or there exists a point in the image that has at least |k|+2 preimages. If the restriction of f to the interior of the domain is a zero-dimensional mapping, then, in the second case, the set of points of the image that have at least |k|+2 preimages contains a subset of total dimension n. In addition, we construct an example of a mapping of a two-dimensional domain that is homeomorphic at the boundary and zero-dimensional, has infinite multiplicity, and is such that its restriction to a sufficiently large part of the branch set is a homeomorphism. __________ Translated from Ukrains'kyi Matematychnyi Zhurnal, Vol. 57, No. 4, pp. 554–558, April, 2005.     

The links of 3‐dimensional singularities defined by Brieskorn polynomials

In this paper, we completely determine the diffeomorphism types of the 5‐dimensional links of 3‐dimensional log‐canonical singularities defined by Brieskorn polynomials. Moreover, we show that if k is an integer with 1 ≤ k < 611, then there is no link K defined by a Brieskorn polynomial in ?⁴ such that the order of H₂(K) is 6k. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some Results on Systems of Finite Sets That Satisfy a Certain Intersection Condition

Let S be a finite set, and fix K>2. Let F be a family of subsets of S with the property that whenever A₁,...,A_k are sets in F, not necessarily distinct, and A₁ ? ? ? A_k = ?, then A₁ ? ? ? A_k = S. We prove here that the maximum size of such a family is 2^|S|?1 + 1. If we require that the sets A₁,...,A_k be distinct, then the maximum size of F is again 2^|S|?1 + 1, provided that |S| ≥ log₂(K?2)+3.     

Random walks supported on random points ofZ/nZ

Summary This paper considers random walks on the integers modn supported onk points and asks how long does it take for these walks to get close to uniformly distributed. Ifk is a constant, Greenhalgh showed that at least some constant timesn ^2/(k–1) steps are necessary to make the distance of the random walk from the uniform distribution small; here we show that ifn is prime, some constant timesn ^2/(k–1) steps suffice to make this distance small for almost all choices ofk points. The proof uses the Upper Bound Lemma of Diaconis and Shahshahani and some averaging techniques. This paper also explores some cases wherek varies withn. In particular, ifk=(logn) ^a , we find different kinds of results for different values ofa, and these results disprove a conjecture of Aldous and Diaconis.Research Supported in Part by a Rackham Faculty Fellowship at the University of Michigan     

Linear preservers of decomposable symmetric tensors

Let U be an n-dimensional vector space over an algebraically closed field F. Let U(^m) denote the mth symmetric power of U. For each positive integer k≤min{m,n}, let D_k denote the set of all nonzero decomposable elements x₁ …x_m in U(^m) such that dim(x₁ …x_m ) = k and E_k denote the set of all decomposable elements x₁ …x_m in U(^m) such that dim(x₁ …x_m ) ≤ k. In this paper we first show that E_k is an algebraic variety with D_k as a dense subset and determine the dimension of E_k . We next use these results to study the structure of linear mappings T on U^m such that T(D_k ) ? D_k or T(E_k ) ? E_k for some fixed k.