相关论文: Dense PG(n-1,2)-free binary matroids

Given integers $k$ and $m$ with $k \geq 2$ and $m \geq 2$, let $P$ be an empty simplex of dimension $(2k-1)$ whose $\delta$-polynomial is of the form $1+(m-1)t^k$. In the present paper, the necessary and sufficient condition for the $k$-th…

We study simple $\mathfrak{sl}(2)$-modules over $\mathbb C$ that are free of finite rank as $U(\mathfrak h)$-modules, where $\mathfrak h$ is a Cartan subalgebra of $\mathfrak{sl}(2)$. Our main result is an explicit classification of the…

Let $M$ be an internally $4$-connected binary matroid with every element in three triangles. Then $M$ has at least four elements $e$ such that si$(M/e)$ is internally 4-connected.

In unpublished work, Geelen proved that a matroid is near-regular if and only if it has no minor isomorphic to: U2,5; U3,5; the Fano plane and its dual; the non-Fano and its dual; the single-element deletion of AG(2,3), its dual, and the…

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

The triangle removal lemma states that a simple graph with o(n^3) triangles can be made triangle-free by removing o(n^2) edges. It is natural to ask if this widely used result can be extended to multi-graphs (or equivalently, weighted…

We study the algebras of hermitian automorphic forms for the lattice $L_n=diag(1,1,\ldots,1,-1)$ and for the field $K=\mathbb{Q}(\sqrt{-d})$ such that $p=2$ is unramified and the ring of integers $\mathcal{O}_K$ is a p.i.d. We prove that…

Let $M$ be a $3$-connected matroid. A pair $\{e,f\}$ in $M$ is detachable if $M \backslash e \backslash f$ or $M / e / f$ is $3$-connected. Williams (2015) proved that if $M$ has at least 13 elements, then at least one of the following…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…

A ring $R$ is said to be $n$-clean if every element can be written as a sum of an idempotent and $n$ units. The class of these rings contains clean ring and $n$-good rings in which each element is a sum of $n$ units. In this paper, we show…

The present work establishes necessary and sufficient conditions for a nonlinear system with two inputs to be described by a specific triangular form. Except for some regularity conditions, such triangular form is flat. This may lead to the…

We show that, if $q$ is a prime power at most 5, then every rank-$r$ matroid with no $U_{2,q+2}$-minor has no more lines than a rank-$r$ projective geometry over GF$(q)$. We also give examples showing that for every other prime power this…

We prove a necessary and sufficient condition for the graded algebra of automorphic forms on a symmetric domain of type IV to be free. From the necessary condition, we derive a classification result. Let $M$ be an even lattice of signature…

Let $M$ be a random $m \times n$ matrix with binary entries and i.i.d. rows. The weight (i.e., number of ones) of a row has a specified probability distribution, with the row chosen uniformly at random given its weight. Let $N(n,m)$ denote…

We provide a number of algorithmic results for the following family of problems: For a given binary m\times n matrix A and integer k, decide whether there is a "simple" binary matrix B which differs from A in at most k entries. For an…

A nonnegative tensor has nonnegative rank at most 2 if and only if it is supermodular and has flattening rank at most 2. We prove this result, then explore the semialgebraic geometry of the general Markov model on phylogenetic trees with…

Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…

For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…