Connected matroids with the smallest whitney numbers

In “The Slimmest Geometric Lattices” (Trans. Amer. Math. Soc.). Dowling and Wilson showed that if G is a combinatorial geometry of rank r(G) = n, and if _X(G) = Σμ(0, x)λ^{r ? r(x)} = Σ (?1)^{r ? k}W_kλ^k is the characteristic polynomial of G, then

$\text{w}{}_{\mathrm{k}}\text{?}\text{r}\text{k}\text{+n}\text{r?1}\text{k}$

Thus γ(G) ? 2^{r ? 1} (n+2), where γ(G) = Σw_k. In this paper we sharpen these lower bounds for connected geometries: If G is connected, r(G) ? 3, and n(G) ? 2 ((r, n) ≠ (4,3)), then

$\text{w}{}_{\mathrm{i}}\text{?}\text{r}\text{i}\text{+ n}\text{r}\text{i+1}\text{for i>1; w}{}_1\text{?r+n}\text{r}\text{2}\text{? 1;}$

|μ| ? (r? 1)n; and γ ? (2^{r ? 1} ? 1)(2n + 2). These bounds are all achieved for the parallel connection of an r-point circuit and an (n + 1)point line. If G is any series-parallel network, $\text{r(G) = r(}\text{G}\text{?}\text{) = 4}$, and $\text{n(G) = n(}\text{G}\text{?}\text{) = 3}$ then $\text{(w}{}_1\text{(G))}{}^4{}_{\mathrm{t-G}}\text{? (w}{}_1\text{(}\text{G}\text{?}\text{)) = (8, 20, 18, 7, 1)}$. Further, if β is the Crapo invariant,

$\text{β(G)=}\text{d}{}_{\mathrm{X}}\text{(G)}\text{dλ}\text{(1)}\text{,}$

then β(G) ? max(1, n ? r + 2). This lower bound is achieved by the parallel connection of a line and a maximal size series-parallel network.     

Lower and upper orientable strong radius and strong diameter of complete k-partite graphs

For two vertices u and v in a strong digraph D, the strong distance sd(u,v) between u and v is the minimum size (the number of arcs) of a strong sub-digraph of D containing u and v. For a vertex v of D, the strong eccentricity se(v) is the strong distance between v and a vertex farthest from v. The strong radius srad(D) (resp. strong diameter sdiam(D)) is the minimum (resp. maximum) strong eccentricity among the vertices of D. The lower (resp. upper) orientable strong radius srad(G) (resp. SRAD(G)) of a graph G is the minimum (resp. maximum) strong radius over all strong orientations of G. The lower (resp. upper) orientable strong diameter sdiam(G) (resp. SDIAM(G)) of a graph G is the minimum (resp. maximum) strong diameter over all strong orientations of G. In this paper, we determine the lower orientable strong radius and diameter of complete k-partite graphs, and give the upper orientable strong diameter and the bounds on the upper orientable strong radius of complete k-partite graphs. We also find an error about the lower orientable strong diameter of complete bipartite graph K_m,n given in [Y.-L. Lai, F.-H. Chiang, C.-H. Lin, T.-C. Yu, Strong distance of complete bipartite graphs, The 19th Workshop on Combinatorial Mathematics and Computation Theory, 2002, pp. 12-16], and give a rigorous proof of a revised conclusion about sdiam(K_m,n).     

Trees of extremal connectivity index

The connectivity index w_α(G) of a graph G is the sum of the weights (d(u)d(v))^α of all edges uv of G, where α is a real number (α≠0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w₁(T). Also, for -1?α<0, we give a sharp lower bound and a upper bound for w_α(T).     

Zeros for accretive operators satisfying certain boundary conditions

Let X be a Banach space with the dual space $\text{X}{}^1$ to be uniformly convex, let D ? X be open, and let $\text{T:}\text{D}\text{?}\text{→ X}$ be strongly accretive (i.e., for some k < 1: (λ ? k)∥ u ? v∥ ? ∥(λ ? 1)(u ? v)+ T(u) ? T(v)∥ for all $\text{u, v ?}\text{D}\text{?}$ and λ > k). Suppose T is demicontinuous and strongly accretive and suppose there exists z?D satisfying: T(x) t(x ? z) for all x??D and t < 0. Then it is shown that T has a unique zero in $\text{D}\text{?}$. This result is then applied to the study of existence of zeros of accretive mappings under apparently different types of boundary conditions on T.     

On weighted lattice paths

A weighted lattice path from (1, 1) to (n, m) is a path consisting of unit vertical, horizontal, and diagonal steps of weight w. Let f(0), f(1), f(2), … be a nondecreasing sequence of positive integers; the path connecting the points of the set $\text{{(n, m) ¦ f(n ? 1) ? m ? f(n), n = 1, 2, …}}$ will be called the roof determined by f. We determine the number of weighted lattice paths from (1, 1) to (n + 1, f(n)) which do not cross the roof determined by f. We also determine the polynomials that must be placed in each cell below the roof such that if a 1 is placed in each cell whose lower left-hand corner is a point of the roof, every k × k square subarray comprised of adjacent rows and columns and containing at least one 1 will have determinant $\text{x(}\text{k}\text{2}\text{)}$.     

A note on similar edges and edge-unique line graphs

If G is a connected graph having no vertices of degree 2 and L(G) is its line graph, two results are proven: if there exist distinct edges e and f with L(G) ? e ? L(G) ? f then there is an automorphism of L(G) mapping e to f; if $\text{G ? u ¦ G ? v}$ for any distinct vertices u, v, then $\text{L(G) ? e ¦ L(G) ? f}$ for any distinct edges e, f.     

Solution of the Hamiltonian problem for self-complementary graphs

A graph G is said to be highly constricted if there exists a nonempty subset S of vertices such that (i) G ? S has more than |S| components, (ii) S induces the complete graph, and (iii) for every u ∈ S and v ? S, we have d_G(u) > d_G(v), where d_G(u) denotes the degree of u in G. In this paper it is shown that a non-hamiltonian self-complementary graph G of order p is highly constricted, unless p = 4N and G is a particular graph $\text{G}{}^1\text{(4N)}$. It is also proved that if G is a self-complementary graph of order p(≥8) and π its degree sequence, then G is pancyclic if π has a realization with a hamiltonian cycle, and G has a 2-factor if π has a realization with a 2-factor, unless p = 4N and $\text{G = G}{}^1\text{(4N)}$.     

Some existence and nonexistence theorems for solutions of degenerate parabolic equations

The initial and boundary value problem for the degenerate parabolic equation v_t = Δ(?(v)) + F(v) in the cylinder $\text{Ω × ¦0, ∞), Ω ? R}{}^{\mathrm{n}}$ bounded, for a certain class of point functions ? satisfying ?′(v) ? 0 (e.g., $\text{?(v) = ¦v¦}{}^{\mathrm{m}}\text{sign}\text{v}$) is considered. In the case that F(v) sign $\text{v ? C(1 + ¦?(v)¦}{}^{\mathrm{\alpha }}\text{), α < 1}$, the equation has a global time solution. The same is true for α = 1 provided the measure of Ω is sufficiently small. In the case that $\text{F(v)}\text{?(v)}$ is nondecreasing a condition is given on the initial state v(x, 0) which implies that the solution must blow up in finite time. The existence of such initial states is discussed.     

Cyclic quartic fields and genus theory of their subfields

Let k = $\text{Q}$(√u) (u ≠ 1 squarefree), K any possible cyclic quartic field containing k. A close relation is established between K and the genus group of k. In particular: (1) Each K can be written uniquely as K = $\text{Q}$(√vwη), where η is fixed in k and satisfies η ? 1, (η) = $\text{U}$²√u, |$\text{U}$²| = |(√u)|, (v, u) = 1, v ∈ $\text{Z}$ is squarefree, w|u, 0 < w < √u. Thus if u ≠ a² + b², there is no K ? k. If u = a² + b² then for each fixed v there are 2^{g ? 1}K ? k, where g is the number of prime divisors of u. (2) $\text{K}\text{k}$ has a relative integral basis (RIB) (i.e., O_K is free over O_k) iff N(ε₀) = ?1 and w = 1, where ε₀ is the fundamental unit of k, (or, equivalently, iff K = $\text{Q}$(√vε₀√u), (v, u) = 1). (3) A RIB is constructed explicitly whenever it exists. (4) disc(K) is given. In particular, the following results are special cases of (2): (i) Narkiewicz showed in 1974 that $\text{K}\text{k}$ has a RIB if u is a prime; (ii) Edgar and Peterson (J. Number Theory12 (1980), 77–83) showed that for u composite there is at least one K ? k having no RIB. Besides, it follows from (4) that the classification and integral basis of K given by Albert (Ann. of Math.31 (1930), 381–418) are wrong.     

Lower bounds on the independence number in terms of the degrees

Wei discovered that the independence number of a graph G is at least Σ_v(1 + d(v))^?1. It is proved here that if G is a connected triangle-free graph on n ≥ 3 vertices and if G is neither an odd cycle nor an odd path, then the bound above can be increased by $\text{n}\text{Δ(Δ + 1)}$, where Δ is the maximum degree. This new bound is sharp for even cycles and for three other graphs. These results relate nicely to some algorithms for finding large independent sets. They also have a natural matrix theory interpretation. A survey of other known lower bounds on the independence number is presented.     

Linear transformations on matrices: the invariance of generalized permutation matrices—III

Let F be a field, F1 be its multiplicative group, and $\text{H}$ = {H:H is a subgroup of F1 and there do not exist a, b?F1 such that Ha+b?H}. Let D_n be the dihedral group of degree n, H be a nontrivial group in $\text{H}$, and τ_n(H) = {α = (α₁, α₂,…, α_n):α_i?H}. For σ?D_n and α?τ_n(H), let P(σ, α) be the matrix whose (i,j) entry is α_iδ_iσ(j) (i.e., a generalized permutation matrix), and

$\text{P(D}{}_{\mathrm{n}}\text{, H) = {P(σ, α):σ?D}{}_{\mathrm{n}}\text{, α?τ}{}_{\mathrm{n}}\text{(H)}}$

. Let M_n(F) be the vector space of all n×n matrices over F and $\text{T}$P(D_n, H) = {T:T is a linear transformation on M_n (F) to itself and T(P(D_n, H)) = P(D_n, H)}. In this paper we classify all T in $\text{T}$P(D_n, H) and determine the structure of the group $\text{T}$P(D_n, H) (Theorems 1 to 4). An expository version of the main results is given in Sec. 1, and an example is given at the end of the paper.     

A convergent two-time method for periodic differential equations

Two timing, an ad hoc method for studying periodic evolution equations, can be given a rigorous justification when the problem is in standard form, u = ?f(t, u). First solve $\text{dw}\text{dσ}\text{= ?(I ? M) f(σ, w)}\text{for}\text{w(σ, v)}$, where M is the mean value operator and v is any initial value. Then w(σ, v) is periodic in σ but does not satisfy the original equation. Now, force a solution u(t), using nonlinear variation of constants, in the form w(σ, v(τ)), where σ = t is the fast time and τ = ?t is the slow time. With the resulting differential equation for v, one reads off from its nonconstant solutions thè approximate transient behavior of u(t) for times of order ?^?1. On the other hand, the equilibrium points (constant solutions) v₀ correspond to steady state (periodic solutions) of the original system. Interesting applications, such as to one-dimensional wave equations with cubic damping, can be given.     

On the inverse problem of the product of a semi-classical form by a polynomial

A form (linear functional) u is called regular if there exists a sequence of polynomials {P_n}_n⩾0, deg P_n=n which is orthogonal with respect to u. Such a form is said to be semi-classical, if there exist polynomials Φ and Ψ such that D(Φu) + Ψu = 0, where D designs the derivative operator.On certain regularity conditions, the product of a semi-classical form by a polynomial, gives a semi-classical form. In this paper, we consider the inverse problem: given a semi-classical form v, find all regular forms u which satisfy the relation x²u = −λv, $\text{λ ∈}\text{C}{}^1$. We give the structure relation (differential-recurrence relation) of the orthogonal polynomial sequence relatively to u. An example is treated with a nonsymmetric form v.     

On a generalization of Minkowski's convex body theorem

Given a lattice $\text{Λ ? R}{}^{\mathrm{n}}$ and a bounded function g(x), x ∈ Rⁿ, vanishing outside of a bounded set, the functions ?(x)$\text{g}\text{?}\text{(x)?}$max_u∈Λg(u +x), ?(x)?Σ_{u∈Λ g(u +x)}, and ?₊(x)?Σ_u∈Λ max_{v∈Λ min {g(v + x); g(u + v + x)}} are defined and periodic mod Λ on Rⁿ. In the paper we prove that ?(x) + ?₊(x) ? 2?(x) ≥ ?(x) + h?₊(x) ? 2?(x) holds for all x ∈ Rⁿ, where h(x) is any “truncation” of g by a constant c ≥ 0, i.e., any function of the form h(x)?g(x) if g(x) ≤ c and h(x)?c if g(x) > c. This inequality easily implies some known estimations in the geometry of numbers due to Rado [1] and Cassels [2]. Moreover, some sharper and more general results are also derived from it. In the paper another inequality of a similar type is also proved.     

On the Szeged and the Laplacian Szeged spectrum of a graph

For a given graph G its Szeged weighting is defined by w(e)=n_u(e)n_v(e), where e=uv is an edge of G,n_u(e) is the number of vertices of G closer to u than to v, and n_v(e) is defined analogously. The adjacency matrix of a graph weighted in this way is called its Szeged matrix. In this paper we determine the spectra of Szeged matrices and their Laplacians for several families of graphs. We also present sharp upper and lower bounds on the eigenvalues of Szeged matrices of graphs.     

Entrainment of frequency in evolution equations

The existence of periodic solutions near resonance is discussed using elementary methods for the evolution equation ·u = Au + ?f(t, u) when the linear problem is totally degenerate (e^2πA = I) and the period of f is entrained with ? (T = 2π(1 + ?μ)). The approach is to solve the periodicity equation u(T,p,?) = p for an element p(?) in D, the domain of A, as a perturbation from an approximate solution p₀. p₀ is a solution of the nonlinear boundary value problem 2πμAp + ∝₀^2πe^?Asf(s, e^Asp) ds = 0 obtained from the periodicity equation by dividing by ?, applying the entrainment assumption, and letting ? → 0. Once p₀ is known, the conventional inverse function theorem is applied in a slightly unconventional manner. Two particular cases where results are obtained are u_t = u_x + ?{g(u) ? h(t, x)} with g strongly monotone and

$\text{d}\text{dt}\text{v}\text{w}\text{=}\text{0}\text{d}\text{dx}\text{d}\text{dx}\text{0}\text{v}\text{w}\text{+ ?}\text{v}{}^3\text{h(t,x)}$

, where in both cases D is a certain class of 2π-periodic functions of x.     

Deterministic version of Wigner's semicircle law for the distribution of matrix eigenvalues

It is proved that Wigner's semicircle law for the distribution of eigenvalues of random matrices, which is important in the statistical theory of energy levels of heavy nuclei, possesses the following completely deterministic version. Let A_n=(a_ij), 1?i, ?n, be the nth section of an infinite Hermitian matrix, {λ⁽ⁿ⁾}_1?k?n its eigenvalues, and {u_k⁽ⁿ⁾}_1?k?n the corresponding (orthonormalized column) eigenvectors. Let $\text{v}{}^1{}_{\mathrm{n}}\text{=(a}{}_{\mathrm{n1}}\text{,a}{}_{\mathrm{n2}}\text{,?,a}{}_{\mathrm{n,n?1}}\text{)}$, put

$\text{X}{}_{\mathrm{n}}\text{(t)=[n(n-1)]}{}^{\mathrm{<mtext>-1</mtext><mtext>2</mtext>}}\text{∑}\text{k=1}\text{[(n-1)t]}\text{|v}{}_{\mathrm{n}}{}^1\text{u}{}_{\mathrm{f}}{}^{\mathrm{(n-1)}}\text{|}{}^2\text{,}\text{0?t?1}$

(bookeeping function for the length of the projections of the new row v¹_n of A_n onto the eigenvectors of the preceding matrix A_n?1), and let finally

$\text{F}{}_{\mathrm{n}}\text{(x)=n}{}^{-1}\text{(}\text{number of}\text{λ}{}_{\mathrm{k}}{}^{\mathrm{(n)}}\text{?x}\text{n}\text{,1?k?n)}$

(empirical distribution function of the eigenvalues of $\text{A}{}_{\mathrm{n}}\text{n}$. Suppose (i) $\text{lim}{}_{\mathrm{n}}\text{a}{}_{\mathrm{nn}}\text{n}\text{=0}$, (ii) lim_nX_n(t)=Ct(0<C<∞,0?t?1). Then

$\text{F}{}_{\mathrm{n}}\text{?W(·,C)}\text{(n→∞)}$

,where W is absolutely continuous with (semicircle) density

$\text{w(x,C)=}\text{(2Cπ)}{}^{-1}\text{(4C-x}{}^2{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{for}\text{|x|?2}\text{C}\text{0}\text{for}\text{|x|?2}\text{C}$

     

Existence and comparison theorems for nonlinear diffusion systems

In this paper we prove existence, uniqueness, and regularity results for systems of nonlinear second order parabolic equations with boundary conditions of the Dirichlet, Neumann, and regular oblique derivative types. Let K(t) consist of all functions (v¹(x), v²(x),…, v^m(x)) from $\text{Ω ? R}{}^{\mathrm{n}}$ into R^m which satisfy ψⁱ(x, t) ? vⁱ(x) ? θⁱ(x, t) for all $\text{x ? Ω}\text{and}\text{1 ? i ? m}$, where ψⁱand θⁱ are extended real-valued functions on $\text{}\text{?}\text{gW × [0, T)}$. We find conditions which will ensure that a solution U(x, t) ≡ (u¹(x, t), u²(x, t),…, u^m(x, t)) which satisfies U(x, 0) ?K(0) will also satisfy U(x, t) ?K(t) for all 0 ? t < T. This result, which has some similarity to the Gronwall Inequality, is then used to prove a global existence theorem.     

Sur les semi-caracteres des groupes de Lie resolubles connexes

Let G be a connected solvable Lie group, π a normal factor representation of G and ψ a nonzero trace on the factor generated by G. We denote by $\text{D}$(G) the space of C^∞ functions on G which are compactly supported. We show that there exists an element u of the enveloping algebra U$\text{G}$_$\text{c}$ of the complexification of the Lie algebra of G for which the linear form $\text{? ψ(π(u 1 ?))}$ on $\text{D}$(G) is a nonzero semiinvariant distribution on G. The proof uses results about characters for connected solvable Lie groups and results about the space of primitive ideals of the enveloping algebra U$\text{G}$_$\text{c}$.