Partially finite convex programming,Part I: Quasi relative interiors and duality theory

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop the notion of the quasi relative interior of a convex set, an extension of the relative interior in finite dimensions. We use this idea in a constraint qualification for a fundamental Fenchel duality result, and then deduce duality results for these problems despite the almost invariable failure of the standard Slater condition. Part II of this work studies applications to more concrete models, whose dual problems are often finite-dimensional and computationally tractable.     

A family of centered forms for a polynomial

The general centered form for multi-variate polynomials is investigated and a computing procedure is proposed that results in a certain superset. Based on this procedure the optimal centered forms for monomials and for some special cases of polynomials are investigated.     

On the ion exchange defects in aluminosilicate lattices

Summary Samples of synthetic leucite and boron-substituted leucite are investigated by infrared spectroscopy and spectrally resolved thermoluminescence. Evidence is obtained in favour of the assumption that point defects in aluminosilicate lattices are originated by exchanges of Si⁺⁴ and Al⁺³ ions lying in different cells.     

Directed triangles in directed graphs

We show that each directed graph (with no parallel arcs) on n vertices, each with indegree and outdegree at least n/twhere t=2.888997… contains a directed circuit of length at most 3.     

The six semifield planes associated with a semifield flock

In 1965 Knuth (J. Algebra 2 (1965) 182) noticed that a finite semifield was determined by a 3-cube array (a_ijk) and that any permutation of the indices would give another semifield. In this article we explain the geometrical significance of these permutations. It is known that a pair of functions (f,g) where f and g are functions from GF(q) to GF(q) with the property that f and g are linear over some subfield and g(x)²+4xf(x) is a non-square for all x∈GF(q)∗, q odd, give rise to certain semifields, one of which is commutative of rank 2 over its middle nucleus, one of which arises from a semifield flock of the quadratic cone, and another that comes from a translation ovoid of Q(4,q). We show that there are in fact six non-isotopic semifields that can be constructed from such a pair of functions, which will give rise to six non-isomorphic semifield planes, unless (f,g) are of linear type or of Dickson-Kantor-Knuth type. These six semifields fall into two sets of three semifields related by Knuth operations.     

Degrevlex Gröbner bases of generic complete intersections

In this paper, we study the Hilbert–Samuel function of a generic standard graded K-algebra

K[X₁,…,X_n]/(g₁,…,g_m)

when refined by an (ℓ)-adic filtration, ℓ being a linear form. From this we obtain a structure theorem which describes the stairs of a generic complete intersection for the degree-reverse-lexicographic order. We show what this means for generic standard (or Gröbner) bases for this order; in particular, we consider an “orderly filling up” conjecture, and we propose a strategy for the standard basis algorithm which could be useful in generic-like cases.     

Consequences of an algorithm for bridged graphs

Chepoi showed that every breadth first search of a bridged graph produces a cop-win ordering of the graph. We note here that Chepoi's proof gives a simple proof of the theorem that G is bridged if and only if G is cop-win and has no induced cycle of length four or five, and that this characterization together with Chepoi's proof reduces the time complexity of bridged graph recognition. Specifically, we show that bridged graph recognition is equivalent to (C₄,C₅)-free graph recognition, and reduce the best known time complexity from O(n⁴) to O(n^3.376).     

Uniform persistence for nonautonomous and random parabolic Kolmogorov systems

The purpose of this paper is to investigate uniform persistence for nonautonomous and random parabolic Kolmogorov systems via the skew-product semiflows approach. It is first shown that the uniform persistence of the skew-product semiflow associated with a nonautonomous (random) parabolic Kolmogorov system implies that of the system. Various sufficient conditions in terms of the so-called unsaturatedness and/or Lyapunov exponents for uniform persistence of the skew-product semiflows are then provided. Among others, it is shown that if the associated skew-product semiflow has a global attractor and its restriction to the boundary of the state space has a Morse decomposition which is unsaturated or whose external Lyapunov exponents are positive, then it is uniformly persistent. More specific conditions are discussed for uniform persistence in n-species, particularly 3-species, random competitive systems.     

An analytical proof of Hardy-like inequalities related to the Dirac operator

We prove some sharp Hardy-type inequalities related to the Dirac operator by elementary, direct methods. Some of these inequalities have been obtained previously using spectral information about the Dirac-Coulomb operator. Our results are stated under optimal conditions on the asymptotics of the potentials near zero and near infinity.