Related papers: Dense binary $PG(t-1,2)$-free matroids have critic…
We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.
The Bergman fan of a matroid is the intersection of tropical hyperplanes defined by the circuits. A tropical basis is a subset of the circuits set that defines the Bergman fan. Yu and Yuster posed a question whether every simple regular…
In the matroid intersection problem, we are given two matroids $\mathcal{M}_1 = (V, \mathcal{I}_1)$ and $\mathcal{M}_2 = (V, \mathcal{I}_2)$ defined on the same ground set $V$ of $n$ elements, and the objective is to find a common…
The crossing number of a graph $G$ in a surface $\Sigma$, denoted by $cr_{\Sigma}(G)$, is the minimum number of pairwise intersections of edges in a drawing of $G$ in $\Sigma$. Let $k$ be an integer satisfying $k\geq 3$, the generalized…
We investigate homological and depth-theoretic properties of finitely generated modules of finite projective dimension over Noetherian local rings. A central theme is the study of criteria for freeness and reflexivity derived from the…
We study totally nonnegative parts of critical varieties in the Grassmannian. We show that each totally nonnegative critical variety Crit$^{\ge0}_f$ is the image of an affine poset cyclohedron under a continuous map and use this map to…
We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…
In this paper, we construct two classes of planar polynomial Hamiltonian systems having a center at the origin, and obtain the lower bounds for the number of critical periods for these systems. For polynomial potential systems of degree…
For the critical level-set of the Gaussian free field on the metric graph of $\mathbb Z^d$, we consider the one-arm probability $\theta_d(N)$, i.e., the probability that the boundary of a box of side length $2N$ is connected to the center.…
The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…
For a matroid $N$, a matroid $M$ is $N$-connected if every two elements of $M$ are in an $N$-minor together. Thus a matroid is connected if and only if it is $U_{1,2}$-connected. This paper proves that $U_{1,2}$ is the only connected…
Let $G$ be a simple, simply connected algebraic group over an algebraically closed field of prime characteristic $p>0$. Recent work of Kildetoft and Nakano and of Sobaje has shown close connections between two long-standing conjectures of…
Let $G$ be a simple algebraic group in defining characteristic $p>0$, and let $V$ be an irreducible $G$-module which is the tensor product of exactly two non-trivial modules. We obtain a criterion for $V$ to have the zero weight. In…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is decidable in…
Let $\mathcal{N}$ be a set of matroids. A matroid $M$ is strictly $\mathcal{N}$-fragile if $M$ has a member of $\mathcal{N}$ as minor and, for all $e \in E(M)$, at least one of $M\backslash e$ and $M/e$ has no minor in $\mathcal{N}$. In…
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
In a recent breakthrough, Dimitrov solved the Schinzel-Zassenhaus Conjecture. We follow his approach and adapt it to certain dynamical systems arising from polynomials of the form $T^p+c$ where $p$ is a prime number and where the orbit of…
We use variational methods to construct a free boundary minimal surface in the three-dimensional unit ball with genus one, two boundary components and prismatic symmetry. Key ingredients are an extension of the equivariant min-max theory to…
Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…