English
Related papers

Related papers: The smallest $I_5$-free and triangle-free binary m…

200 papers

We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…

Rings and Algebras · Mathematics 2018-08-06 Konrad Schrempf

In this paper, we make some progress towards a well-known conjecture on the minimum weights of binary cyclic codes with two primitive nonzeros. We also determine the Walsh spectrum of $\Tr(x^d)$ over $\F_{2^{m}}$ in the case where $m=2t$,…

Information Theory · Computer Science 2015-06-12 Tao Feng , Ka Hin Leung , Qing Xiang

One of Erdos's conjectures states that every triangle-free graph on $n$ vertices has an induced subgraph on $n/2$ vertices with at most $n^2/50$ edges. We report several partial results towards this conjecture. In particular, we establish…

Combinatorics · Mathematics 2022-04-06 Alexander Razborov

Based upon properties of ordinal length, we introduce a new class of modules, the binary modules, and study their endomorphism ring. The nilpotent endomorphisms form a two-sided ideal, and after factoring this out, we get a commutative…

Commutative Algebra · Mathematics 2012-12-11 Hans Schoutens

For the $N$-dimensional Fourier matrix $\mathcal{F}_N$, we prove that if $N\geq 4$ is square-free, then every $2 \times 2$ and $3\times 3$ principal minor of $\mathcal{F}_N$ is nonzero. We also show that if $N\geq 4$ is not square-free,…

Functional Analysis · Mathematics 2025-04-22 Andrei Caragea , Dae Gwan Lee

We describe all of the smooth complete toric threefolds of Picard number 5 with no nontrivial nef line bundles, and show that no such examples exist with Picard number less than 5.

Algebraic Geometry · Mathematics 2007-06-23 Osamu Fujino , Sam Payne

In this paper we describe the number of multiplicity-free primitive ideals associated with the rigid nilpotent orbits in finite-dimensional simple Lie algebras. Thanks to the results obtained earlier we need to solve the problem for the two…

Representation Theory · Mathematics 2023-08-02 Alexander Premet , David Stewart

We settle three problems from the literature on stable and real zero polynomials and their connection to matroid theory. We disprove the weak real zero amalgamation conjecture by Schweighofer and the second author. We disprove a conjecture…

Combinatorics · Mathematics 2026-01-30 Mario Kummer , David Sawall

Recently, settling a question of Erd\H{o}s, Balogh and Pet\v{r}\'{i}\v{c}kov\'{a} showed that there are at most $2^{n^2/8+o(n^2)}$ $n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the…

Combinatorics · Mathematics 2016-08-07 József Balogh , Hong Liu , Šárka Petříčková , Maryam Sharifzadeh

We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their…

Combinatorics · Mathematics 2020-12-23 Vaidy Sivaraman , Daniel Slilaty

There are finitely many graphs with diameter $2$ and girth 5. What if the girth 5 assumption is relaxed? Apart from stars, are there finitely many triangle-free graphs with diameter $2$ and no $K_{2,3}$ subgraph? This question is related to…

We consider the small-angle multiple neutron scattering and a possibility of its model-free analysis by the inverse problem method. We show that the ill-defined problem is essentially regularized by use of a planar detector without a…

Materials Science · Physics 2007-05-23 D. N. Aristov

The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…

Combinatorics · Mathematics 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

In this article, we investigate the multi-parametric matroid problem. The weights of the elements of the matroid's ground set depend linearly on an arbitrary but fixed number of parameters, each of which is taken from a real interval. The…

Combinatorics · Mathematics 2025-03-13 Nils Hausbrandt , Stefan Ruzika

We show that the smallest non-cyclic quotients of braid groups are symmetric groups, proving a conjecture of Margalit. Moreover we recover results of Artin and Lin about the classification of homomorphisms from braid groups on n strands to…

Geometric Topology · Mathematics 2021-10-06 Sudipta Kolay

Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…

Combinatorics · Mathematics 2021-01-07 Amanda Cameron , Dillon Mayhew

For a binary matrix X, the Boolean rank br(X) is the smallest integer k for which X equals the Boolean sum of k rank-1 binary matrices, and the isolation number i(X) is the maximum number of 1s no two of which are in a same row, column and…

Combinatorics · Mathematics 2022-06-10 Reka Agnes Kovacs

We classify solvable Lie groups with a free nilradical admitting an Einstein left-invariant metric. Any such group is essentially determined by the nilradical of its Lie algebra, which is then called an Einstein nilradical. We show that…

Differential Geometry · Mathematics 2007-05-23 Y. Nikolayevsky

We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Takayuki Hibi , Satoshi Murai , Yukihide Takayama

If EE is a set of matroids, then ex(EE) denotes the set of matroids that have no minor isomorphic to a member of EE. If EE' is a subset of EE, we say that EE' is /superfluous/ if ex(EE - EE') - ex(EE) contains only finitely many 3-connected…

Combinatorics · Mathematics 2011-11-01 Rhiannon Hall , Dillon Mayhew , Stefan H. M. van Zwam