相关论文: On the structure of dense triangle-free binary mat…

The equilibrium of incompressible spheroid-ring systems in rigid rotation is investigated by numerical means for a unity density contrast. A great diversity of binary configurations is obtained, with no limit neither in the mass ratio, nor…

Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Massive stars can be found in wide (hundreds to thousands AU) binaries with other massive stars. We use $N$-body simulations to show that any bound cluster should always have approximately one massive wide binary: one will probably form if…

Let $\cM$ be a minor-closed class of matroids that does not contain arbitrarily long lines. The growth rate function, $h:\bN\rightarrow \bN$ of $\cM$ is given by $$h(n) = \max(|M|\, : \, M\in \cM, simple, rank-$n$).$$ The Growth Rate…

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Let $P(M)$ be the matroid base polytope of a matroid $M$. A {\em matroid base polytope decomposition} of $P(M)$ is a decomposition of the form $P(M) = \bigcup\limits_{i=1}^t P(M_{i})$ where each $P(M_i)$ is also a matroid base polytope for…

We show that every $\mathbb{Z}$-torsion free knot module is realized by a ribbon 2-knot with group of geometric dimension at most 2, and give some partial results on the characterization of the knot modules of fibred ribbon 2-knots.

The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…

Bi-objective optimization problems on matroids are in general intractable and their corresponding decision problems are in general NP-hard. However, if one of the objective functions is restricted to binary cost coefficients the problem…

In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…

Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…

Like most multiobjective combinatorial optimization problems, biobjective optimization problems on matroids are in general intractable and their corresponding decision problems are in general NP-hard. In this paper, we consider biobjective…

We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range.…

A set $S\subseteq 2^E$ of subsets of a finite set $E$ is \emph{powerful} if, for all $X\subseteq E$, the number of subsets of $X$ in $S$ is a power of 2. Each powerful set is associated with a non-negative integer valued function, which we…

In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

In this article, we show that the critical catenoid, as a free boundary minimal surface of the unit ball in $\mathbb{R}^3$, has index $4$. We also prove that a free boundary minimal surface of the unit ball in $\mathbb{R}^3$, that is not a…

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…