English
Related papers

Related papers: Dense binary $PG(t-1,2)$-free matroids have critic…

200 papers

We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…

Logic · Mathematics 2016-07-21 Peter Cholak , Gregory Igusa

We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…

Mathematical Physics · Physics 2015-04-09 Oksana Bihun , Francesco Calogero

Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, $n$. Meanders are considered distinct up to any smooth deformation leaving the line fixed.…

Statistical Mechanics · Physics 2007-05-23 Iwan Jensen , Anthony J Guttmann

We call a matroid element "loose" if it is contained in no circuits of size less than the rank of the matroid. A matroid in which all elements are loose is a paving matroid. Acketa determined all binary paving matroids, while Oxley…

Combinatorics · Mathematics 2025-01-15 Jagdeep Singh , Thomas Zaslavsky

Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…

Combinatorics · Mathematics 2015-03-13 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…

Probability · Mathematics 2017-05-05 Janko Gravner , Alexander E. Holroyd

We show that for any fixed $\eps>0$, there are numbers $\delta>0$ and $p_0\ge 2$ with the following property: for every prime $p\ge p_0$ and every integer $N$ such that $p^{1/(4\sqrt{e})+\eps}\le N\le p$, the sequence $1,2,...,N$ contains…

Number Theory · Mathematics 2014-02-26 W. D. Banks , M. Z. Garaev , D. R. Heath-Brown , I. E. Shparlinski

We study the cancellation property of projective modules of rank $2$ with a trivial determinant over Noetherian rings of dimension $\leq 4$. If $R$ is a smooth affine algebra of dimension $4$ over an algebraically closed field $k$ such that…

Algebraic Geometry · Mathematics 2021-04-20 Tariq Syed

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Combinatorics · Mathematics 2025-11-19 Jonah Berggren , Jeremy L. Martin , José A. Samper

A 0-1 matrix $M$ contains a 0-1 matrix $P$ if $M$ has a submatrix $P'$ which can be turned into $P$ by changing some of the ones to zeroes. Matrix $M$ is $P$-saturated if $M$ does not contain $P$, but any matrix $M'$ derived from $M$ by…

Combinatorics · Mathematics 2025-03-06 Andrew Brahms , Alan Duan , Jesse Geneson , Jacob Greene

The tropical Grassmannian ${\rm Trop}\, G(2,n)$ is known to be the moduli space of unrooted metric trees with $n$ leaves. A positive part can be defined for each of the $(n-1)!/2$ possible planar orderings, $\alpha$, and agrees with the…

Combinatorics · Mathematics 2021-04-22 Freddy Cachazo

Constructive proofs of fact that a stably free left $S$-module $M$ with rank$(M)\geq$sr$(S)$ is free, where sr$(S)$ denotes the stable rank of an arbitrary ring $S$, were developed in some articles. Additionally, in such papers, are…

Rings and Algebras · Mathematics 2015-10-20 Claudia Gallego

We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…

Statistical Mechanics · Physics 2015-05-14 Christian R. Scullard , Robert M. Ziff

Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…

Data Structures and Algorithms · Computer Science 2019-02-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh , Meirav Zehavi

We study the $N=3$ case of the $CP^{N-1}$ model, which is a field theory of $N$ complex scalars in $3d$ coupled to an Abelian gauge field with $SU(N) \times U(1)$ global symmetry. Recent evidence suggests the $N=2$ theory is not critical,…

High Energy Physics - Theory · Physics 2025-07-10 Shai M. Chester , Alessandro Piazza , Marten Reehorst , Ning Su

A Laman graph $G$ is a minimally rigid graph in dimension two, and its realization number is its number of distinct embeddings with fixed generic edge lengths. While conjectured to grow exponentially in the number of vertices of $G$, the…

Combinatorics · Mathematics 2025-11-13 Amelia Bielby , Arushi Chauhan , Cassia Pearce , Yue Ren

Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…

Algebraic Geometry · Mathematics 2007-05-23 Brian Harbourne , Joaquim Roé

We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from $\{-\Delta,\ldots,\Delta\}$ or more generally $m$-dimensional vectors of such discrete values. We…

Data Structures and Algorithms · Computer Science 2024-08-27 Friedrich Eisenbrand , Lars Rohwedder , Karol Węgrzycki

The Galois ring $GR(p^r,m)$ of characteristic $p^r$ and cardinality $p^{rm}$, where $p$ is a prime and $r,m \ge 1$ are integers, is a Galois extension of the residue class ring $Z_{p^r}$ by a root $\omega$ of a monic basic irreducible…

Information Theory · Computer Science 2014-10-02 Virgilio Sison

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…

Combinatorics · Mathematics 2024-01-11 Paul Balister , Gal Kronenberg , Alex Scott , Youri Tamitegama
‹ Prev 1 8 9 10 Next ›