相关论文: Thresholds for $(n,q,2)$-Steiner Systems via Refin…

Let $n,k$ denote integers with $n>2k\geq 6$. Let $\mathbb{F}_q$ denote a finite field with $q$ elements, and let $V$ denote a vector space over $\mathbb{F}_q$ that has dimension $n$. The projective geometry $P_q(n)$ is the partially ordered…

This paper characterizes two forms of separability of pure states of systems of n qubits: (i) into a tensor product of n qubit states, and (ii), into a tensor product of 2 subsystems states of p and q qubits respectively with p+q=n. For…

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a…

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…

Let $O(p,q)$ be the orthogonal groups of signature $(p,q)$ over the reals. It is shown that an element of the commutator subgroup $O(p,q)'$ of $O(p,q)$ is bireflectional (product of 2 involutions in $O(p,q)'$) if and only if it is…

In this paper we prove the Harbourne-Hirschowitz conjecture for quasi-homogeneous linear systems of multiplicity 6 on P^2. For the proof we use the degeneration of the plane by Ciliberto and Miranda and results by Laface, Seibert, Ugaglia…

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

We show that for any two Heegaard splittings of genus $p$ and $q$ for the same closed 3-manifold, there is a common stabilization of genus at most 3/2 p + 2q - 1. One may compare this to recent examples of Heegaard splittings whose smallest…

We prove a new case of Rubin's saturation conjecture about the realization of $G$-transfer systems, for $G$ a finite cyclic group, by linear isometries $N_\infty$-operads, namely the case of cyclic groups of order $p^nq^m$ for $p,q$…

An $(r, s)$-${\textit set}$ in ${\rm PG}(n, q)$ is a set of points, say $\mathcal X$, such that each $s$-dimensional projective subspace contains at most $r$ points of $\mathcal X$. We investigate $(n, n-2)$-sets and $(n-2, n-3)$-sets in…

Let $\Bbb F_q$ be the finite field with $q$ elements and let $p=\text{char}\,\Bbb F_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots+X^{q^a-2}$ is a permutation polynomial of…

The differential geometry of almost Grassmann structures defined on a differentiable manifold of dimension n = pq by a fibration of Segre cones SC (p, q) is studied. The peculiarities in the structure of almost Grassmann structures for the…

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

A graph $G$ is called universal for a family of graphs $\mathcal{F}$ if it contains every element $F \in \mathcal{F}$ as a subgraph. Let $\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…