Critical Exponents, Colines, and Projective Geometries

2000 ◽  
Vol 9 (4) ◽  
pp. 355-362 ◽  
Author(s):  
JOSEPH P. S. KUNG

In [9, p. 469], Oxley made the following conjecture, which is a geometric analogue of a conjecture of Lovász (see [1, p. 290]) about complete graphs.Conjecture 1.1.Let G be a rank-n GF(q)-representable simple matroid with critical exponent n − γ. If, for every coline X in G, c(G/X; q) = c(G; q) − 2 = n − γ − 2, then G is the projective geometry PG(n − 1, q).We shall call the rank n, the critical ‘co-exponent’ γ, and the order q of the field the parameters of Oxley's conjecture. We exhibit several counterexamples to this conjecture. These examples show that, for a given prime power q and a given positive integer γ, Oxley's conjecture holds for only finitely many ranks n. We shall assume familiarity with matroid theory and, in particular, the theory of critical problems. See [6] and [9].A subset C of points of PG(n − 1, q) is a (γ, k)-cordon if, for every k-codimensional subspace X in PG(n − 1, q), the intersection C ∩ X contains a γ-dimensional subspace of PG(n − 1, q). In this paper, our primary interest will be in constructing (γ, 2)-cordons. With straightforward modifications, our methods will also yield (γ, k)-cordons.Complements of counterexamples to Oxley's conjecture are (γ, 2)-cordons.

10.37236/556 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Kazuaki Ishii

There are many nonisomorphic orthogonal arrays with parameters $OA(s^3,s^2+s+1,s,2)$ although the existence of the arrays yields many restrictions. We denote this by $OA(3,s)$ for simplicity. V. D. Tonchev showed that for even the case of $s=3$, there are at least 68 nonisomorphic orthogonal arrays. The arrays that are constructed by the $n-$dimensional finite spaces have parameters $OA(s^n, (s^n-1)/(s-1),s,2)$. They are called Rao-Hamming type. In this paper we characterize the $OA(3,s)$ of 3-dimensional Rao-Hamming type. We prove several results for a special type of $OA(3,s)$ that satisfies the following condition: For any three rows in the orthogonal array, there exists at least one column, in which the entries of the three rows equal to each other. We call this property $\alpha$-type. We prove the following. (1) An $OA(3,s)$ of $\alpha$-type exists if and only if $s$ is a prime power. (2) $OA(3,s)$s of $\alpha$-type are isomorphic to each other as orthogonal arrays. (3) An $OA(3,s)$ of $\alpha$-type yields $PG(3,s)$. (4) The 3-dimensional Rao-Hamming is an $OA(3,s)$ of $\alpha$-type. (5) A linear $OA(3,s)$ is of $\alpha $-type.


2014 ◽  
Vol 10 (08) ◽  
pp. 1921-1927 ◽  
Author(s):  
Winfried Kohnen ◽  
Yves Martin

Let f be an even integral weight, normalized, cuspidal Hecke eigenform over SL2(ℤ) with Fourier coefficients a(n). Let j be a positive integer. We prove that for almost all primes p the sequence (a(pjn))n≥0 has infinitely many sign changes. We also obtain a similar result for any cusp form with real Fourier coefficients that provide the characteristic polynomial of some generalized Hecke operator is irreducible over ℚ.


1980 ◽  
Vol 32 (6) ◽  
pp. 1299-1305 ◽  
Author(s):  
Barbu C. Kestenband

We show that any PG(2n, q2) is a disjoint union of (q2n+1 − 1)/ (q − 1) caps, each cap consisting of (q2n+1 + 1)/(q + 1) points. Furthermore, these caps constitute the “large points” of a PG(2n, q), with the incidence relation defined in a natural way.A square matrix H = (hij) over the finite field GF(q2), q a prime power, is said to be Hermitian if hijq = hij for all i, j [1, p. 1161]. In particular, hii ∈ GF(q). If if is Hermitian, so is p(H), where p(x) is any polynomial with coefficients in GF(q).Given a Desarguesian Projective Geometry PG(2n, q2), n > 0, we denote its points by column vectors:All Hermitian matrices in this paper will be 2n + 1 by 2n + 1, n > 0.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
M. Haris Mateen ◽  
M. Khalid Mahmood ◽  
Shahbaz Ali ◽  
M. D. Ashraful Alam

In this study, we investigate two graphs, one of which has units of a ring Z n as vertices (or nodes) and an edge will be built between two vertices u and v if and only if u 3 ≡ v 3 mod   n . This graph will be termed as cubic residue graph. While the other is called Gaussian quadratic residue graph whose vertices are the elements of a Gaussian ring Z n i of the form α = a + i b , β = c + i    d , where a , b , c , d are the units of Z n . Two vertices α and β are adjacent to each other if and only if α 2 ≡ β 2 mod   n . In this piece of work, we characterize cubic and Gaussian quadratic residue graphs for each positive integer n in terms of complete graphs.


10.37236/1556 ◽  
2001 ◽  
Vol 8 (1) ◽  
Author(s):  
Yury J. Ionin

Balanced generalized weighing matrices are applied for constructing a family of symmetric designs with parameters $(1+qr(r^{m+1}-1)/(r-1),r^{m},r^{m-1}(r-1)/q)$, where $m$ is any positive integer and $q$ and $r=(q^{d}-1)/(q-1)$ are prime powers, and a family of non-embeddable quasi-residual $2-((r+1)(r^{m+1}-1)/(r-1),r^{m}(r+1)/2,r^{m}(r-1)/2)$ designs, where $m$ is any positive integer and $r=2^{d}-1$, $3\cdot 2^{d}-1$ or $5\cdot 2^{d}-1$ is a prime power, $r\geq 11$.


2019 ◽  
Vol 39 (5) ◽  
pp. 623-643
Author(s):  
Ryan C. Bunge

Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let \(G\) be a tripartite graph with \(n\) edges, one of which is a pendent edge. This paper introduces a labeling on such a graph \(G\) used to achieve 1-rotational \(G\)-decompositions of \(K_{2nt}\) for any positive integer \(t\). It is also shown that if \(G\) with a pendent edge is the result of adding an edge to a path on \(n\) vertices, then \(G\) admits such a labeling.


Filomat ◽  
2020 ◽  
Vol 34 (10) ◽  
pp. 3275-3286
Author(s):  
Rachid Lemdani ◽  
Moncef Abbas ◽  
Jasmina Ferme

Given a graph G and a positive integer i, an i-packing in G is a subset W of the vertex set of G such that the distance between any two distinct vertices from W is greater than i. The packing chromatic number of a graph G, ??(G), is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ? {1,..., k}, where each Vi is an i-packing. In this paper, we present some general properties of packing chromatic numbers of finite super subdivisions of graphs. We determine the packing chromatic numbers of the finite super subdivisions of complete graphs, cycles and some neighborhood corona graphs.


Author(s):  
Behnaz Tolue ◽  
Amin Rafiei

In this paper, the new concept [Formula: see text]-isodominism between two graphs is introduced, where [Formula: see text] is a positive integer. The [Formula: see text]-isodominism is a pair of the graph isomorphism which depends on the smallest [Formula: see text]-dominating sets. By this tool, a graph with one vertex, complete graphs, wheels and stars are in the same [Formula: see text]-isodominism class. Furthermore, some results about the [Formula: see text]-isodominism classes of paths, cycles and star polygon are presented.


1969 ◽  
Vol 12 (4) ◽  
pp. 493-497 ◽  
Author(s):  
R. C. Mullin ◽  
E. Nemeth

It is shown that if v is an odd prime power, other than a prime of the form 22n + 1, then there exists a Room square of order v + 1.A room square of order 2n, where n is a positive integer, is an arrangement of 2n objects in a square array of 2 side 2n - 1, such that each of the (2n - 1)2 cells of the array is either-empty or contains exactly two distinct objects; each of the 2n objects appears exactly once in each row and column; and each (unordered) pair of objects occurs in exactly one cell.


1985 ◽  
Vol 37 (6) ◽  
pp. 1163-1175 ◽  
Author(s):  
Gary L. Ebert

In [2] by means of a fairly lengthy argument involving Hermitian varieties it was shown that PG(2n, q2) can be partitioned into (q2n++ 1 + 1)/(q + l)-caps. Moreover, these caps were shown to constitute the “large points” of a PG(2n, q) in a natural way. In [3] a similar argument was used to show that once two disjoint (n – l)-subspaces are removed from PG(2n, q2), the remaining points can be partitioned into (q2n – 1)/(q2 – l)-caps.The purpose of this paper is to give a short proof of the results found in [2], and then use the technique developed to partition PG(2n, q) into (qn + l)-caps for n even and q any prime-power. Moreover, these caps can be treated in a natural way as the “large points” of a PG(n – 1, q).


Sign in / Sign up

Export Citation Format

Share Document