English
Related papers

Related papers: On a Class of Binary Matrices

200 papers

Let C_1 and C_2 be skew circuits in a binary matroid having circumference c. For any positive integer k there is a constant a_k such that if min { |A| ; C_1 \subset A \subset E-A} > a_k, then |C_1| + |C_2| < 2c -k.

Combinatorics · Mathematics 2026-03-09 Sean McGuinness

Revisiting a $50$-year-old estimate of Choi, Erd\H{o}s and Szemer\'edi, we show that if $A \subseteq \{1, 2, \ldots, 2n\}$ satisfies $|A| \ge n + 1.2 \cdot 10^8$, then there exist five distinct integers whose pairwise sums are all contained…

Number Theory · Mathematics 2026-05-04 Wouter van Doorn

Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…

Representation Theory · Mathematics 2023-07-06 Haibo Jin , Dong Yang , Guodong Zhou

The aim of this paper is to get a complete list of positive definite symmetric matrices with integer entries $\a&b\b&d\$ such that all complex solutions to the system of equations $1-x_1=x_1^ax_2^b\ 1-x_2=x_1^bx_2^d$ are real. This result…

Mathematical Physics · Physics 2011-06-06 An Huang , Chul-hee Lee

For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some…

Combinatorics · Mathematics 2010-11-29 Richard A. Brualdi , Kathleen P. Kiernan , Seth A. Meyer , Michael W. Schroeder

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

Combinatorics · Mathematics 2011-06-10 Hidehiko Kamiya , Akimichi Takemura , Hiroaki Terao

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

Combinatorics · Mathematics 2016-11-08 David Cushing , G. W. Stagg

We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some $k$, or the entire multiplication table of a certain large abelian group, as a…

Combinatorics · Mathematics 2019-04-10 Jason Long

We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to…

Metric Geometry · Mathematics 2018-03-12 Tamás Keleti , Dániel T. Nagy , Pablo Shmerkin

Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…

Algebraic Geometry · Mathematics 2014-01-14 Natalia Dück , Karl-Heinz Zimmermann

A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…

Combinatorics · Mathematics 2011-07-08 Harald Fripertinger , Marcel Wild

Let $V$ be a nonempty finite set and $A=(a_{ij})_{i,j\in V}$ be a matrix with entries in a field $\mathbb{K}$. For a subset $X$ of $V$, we denote by $A[X]$ the submatrix of $A$ having row and column indices in $X$. We study the following…

Combinatorics · Mathematics 2015-05-27 A. Boussairi , B. Chergui

In this paper, we state and prove precise theorems on the classification of the category of (braided) categorical groups and their (braided) monoidal functors, and some applications obtained from the basic studies on monoidal functors…

Category Theory · Mathematics 2013-01-04 Nguyen Tien Quang , Nguyen Thu Thuy , Pham Thi Cuc

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

Probability · Mathematics 2007-11-20 Kevin P. Costello , Van Vu

This is the second installment of an exposition of an ACL2 formalization of elementary linear algebra. It extends the results of Part I, which covers the algebra of matrices over a commutative ring, but focuses on aspects of the theory that…

Discrete Mathematics · Computer Science 2025-07-28 David Russinoff

This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…

Logic · Mathematics 2009-09-25 John T. Baldwin , Saharon Shelah

The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back…

Computational Geometry · Computer Science 2017-07-21 Stephen G. Kobourov , Giuseppe Liotta , Fabrizio Montecchiani

Fix a quadratic order over the ring of integers. An embedding of the quadratic order into a quaternionic order naturally gives an integral binary hermitian form over the quadratic order. We show that, in certain cases, this correspondence…

Number Theory · Mathematics 2017-07-31 Gordan Savin , Michael Zhao

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…

Combinatorics · Mathematics 2024-12-17 Catherine Falvey , Heewon Hah , William Sheppard , Brian Sittinger , Rico Vicente