Strongly regular graphs from reducible cyclic codes

Journal of Algebraic Combinatorics - Let p be a prime number. Reducible cyclic codes of rank 2 over $$\mathbb {Z}_{p^m}$$ are shown to have exactly two Hamming weights in some cases. Their weight...     

On the minimal reducible bound for outerplanar and planar graphs

Let L be the set of all additive and hereditary properties of graphs. For P₁, P₂ L we define the reducible property R = P₁ P₂ as follows: G P₁P₂ if there is a bipartition (V₁, V₂) of V(G) such that V₁ P₁ and V₂ P₂. For a property P L, a reducible property R is called a minimal reducible bound for P if P R and for each reducible property R′, R′ R → P R′. It is proved that the class of all outerplanar graphs has exactly two minimal reducible bounds in L. Some related problems for planar graphs are discussed.     

Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs

A benzenoid graph is a finite connected plane graph with no cut vertices in which every interior region is bounded by a regular hexagon of a side length one. A benzenoid graph G is elementary if every edge belongs to a 1-factor of G. A hexagon h of an elementary benzenoid graph is reducible, if the removal of boundary edges and vertices of h results in an elementary benzenoid graph. We characterize the reducible hexagons of an elementary benzenoid graph. The characterization is the basis for an algorithm which finds the sequence of reducible hexagons that decompose a graph of this class in O(n²) time. Moreover, we present an algorithm which decomposes an elementary benzenoid graph with at most one pericondensed component in linear time.     

Trigonal reducible curves

Here we study the canonical model of a reducible trigonal Gorenstein curve X. We prove that the canonical model is arithmetically Cohen — Macaulay and lies in a minimal degree Hirzebruch surface, generalizing the classical theory of Maroni on smooth trigonal curves.     

On reducible Heegaard splittings

Let V∪S W be a reducible Heegaard splitting of genus g = g(S)≥2.For a maximal prime connected sum decomposition of V∪S W,let q denote the number of the genus 1 Heegaard splittings of S2×S1 in the decomposition,and p the number of all other prime factors in the decomposition.The main result of the present paper is to describe the relation of p,q and dim(C V∩CW).     

Completely reducible Lie subalgebras

Let G be a connected and reductive group over the algebraically closed field K. J-P. Serre has introduced the notion of a G-completely reducible subgroup H ⊂ G. In this paper, we give a notion of G-complete reducibility—G-cr for short—for Lie subalgebras of Lie(G), and we show that if the closed subgroup H ⊂ G is G-cr, then Lie(H) is G-cr as well.     

On reducible matrix patterns

A tool to study the inertias of reducible nonzero (resp. sign) patterns is presented. Sumsets are used to obtain a list of inertias attainable by the pattern 𝒜 ⊕ ? dependent upon inertias attainable by patterns 𝒜 and ?. It is shown that if ? is a pattern of order n, and 𝒜 is an inertially arbitrary pattern of order at least 2(n ? 1), then 𝒜 ⊕ ? is inertially arbitrary if and only if ? allows the inertias (0, 0, n), (0, n, 0) and (n, 0, 0). We illustrate how to construct other reducible inertially (resp. spectrally) arbitrary patterns from an inertially (resp. spectrally) arbitrary pattern 𝒜 ⊕ ?, by replacing 𝒜 with an inertially (resp. spectrally) arbitrary pattern 𝒮. We identify reducible inertially (resp. spectrally) arbitrary patterns of the smallest orders that contain some irreducible components that are not inertially (resp. spectrally) arbitrary. It is shown there exist nonzero (resp. sign) patterns 𝒜 and ? of orders 4 and 5 (resp. 4 and 4) such that both 𝒜 and ? are non-inertially-arbitrary, and 𝒜 ⊕ ? is inertially arbitrary.     

On reducible trinomials,III

It is shown that if a trinomial has a trinomial factor then under certain conditions the cofactor is irreducible.     

Measure of reducible difference systems

We consider a difference system with quasiperiodic coefficientsx _n+1=Ax _n+P(_n)x_n, _n+1=_n+ An estimate is obtained of the measure of the set of those matrices A for which the given system is reducible to a system with constant coefficients.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 11, pp. 1572–1575, November, 1990.     

Reducible means and reducible inequalities

It is well-known that if a real valued function acting on a convex set satisfies the n-variable Jensen inequality, for some natural number \(n\ge 2\), then, for all \(k\in \{1,\dots , n\}\), it fulfills the k-variable Jensen inequality as well. In other words, the arithmetic mean and the Jensen inequality (as a convexity property) are both reducible. Motivated by this phenomenon, we investigate this property concerning more general means and convexity notions. We introduce a wide class of means which generalize the well-known means for arbitrary linear spaces and enjoy a so-called reducibility property. Finally, we give a sufficient condition for the reducibility of the (M, N)-convexity property of functions and also for Hölder–Minkowski type inequalities.     

Four‐terminal reducibility and projective‐planar wye‐delta‐wye‐reducible graphs

A graph is YΔY‐reducible if it can be reduced to a vertex by a sequence of series‐parallel reductions and YΔY‐transformations. Terminals are distinguished vertices, that cannot be deleted by reductions and transformations. In this article, we show that four‐terminal planar graphs are YΔY‐reducible when at least three of the vertices lie on the same face. Using this result, we characterize YΔY‐reducible projective‐planar graphs. We also consider terminals in projective‐planar graphs, and establish that graphs of crossing‐number one are YΔY‐reducible. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 83–93, 2000     

Families of reducible algebraic varieties

Translated fromMatematicheskie Zametki, Vol. 60, No. 6, pp. 946–949, December, 1996.