Related papers: Integer Carath\'eodory results with bounded multip…

The Ramsey number $R(s,t)$ is the least integer $n$ such that any coloring of the edges of $K_n$ with two colors produces either a monochromatic $K_s$ in one color or a monochromatic $K_t$ in the other. If $s=t$, we say that the Ramsey…

It is known that degrees of basic relative invariants of homogeneous open convex cones of rank $r$ are less than or equal to $2^{r-1}$. In this article, we show that there exists a homogeneous cone of rank $r$ one of whose basic relative…

Let $(R,\m)$ be a formally unmixed local ring of positive prime characteristic and dimension $d$. We examine the implications of having small Hilbert-Kunz multiplicity (i.e., close to 1). In particular, we show that if $R$ is not regular,…

In this paper we deduce a lower bound for the rank of a family of $p$ vectors in $\R^k$ (considered as a vector space over the rationals) from the existence of a sequence of linear forms on $\R^p$, with integer coefficients, which are small…

The approximate Carath\'eodory problem in general form is as follows: Given two symmetric convex bodies $P,Q \subseteq \mathbb{R}^m$, a parameter $k \in \mathbb{N}$ and $\mathbf{z} \in \textrm{conv}(X)$ with $X \subseteq P$, find…

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

Let $n_g(k)$ denote the smallest order of a $k$-chromatic graph of girth at least $g$. We consider the problem of determining $n_g(k)$ for small values of $k$ and $g$. After giving an overview of what is known about $n_g(k)$, we provide…

Cohen Macaulay property of fiber cones of ideals is characterized in terms of its Hilbert series. Hilbert series of fiber cones of ideals with minimal mixed multiplicity is calculated. It is proved that the fiber cone of an m-primary ideal…

The binary rank of a $0,1$ matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix $M$ is called $(k_1, \ldots, k_m ; n_1, \ldots, n_m)$ circulant block diagonal if it is a block matrix…

The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$. In this article, we give estimates on…

Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank,…

A recent result of Bokal et al. [Combinatorica, 2022] proved that the exact minimum value of c such that c-crossing-critical graphs do not have bounded maximum degree is c=13. The key to that result is an inductive construction of a family…

For a simplicial complex $\Delta$ we study the effect of barycentric subdivision on ring theoretic invariants of its Stanley-Reisner ring. In particular, for Stanley-Reisner rings of barycentric subdivisions we verify a conjecture by Huneke…

The dichromatic number $\vec{\chi}(D)$ of a digraph $D$ is the smallest $k$ for which it admits a $k$-coloring where every color class induces an acyclic subgraph. Inspired by Hadwiger's conjecture for undirected graphs, several groups of…

In our previous work we studied minimal fractional decompositions of a rational matrix pseudodifferential operator: H=A/B, where A and B are matrix differential operators, and B is non-degenerate of minimal possible degree deg(B). In the…

An identifying open code of a graph $G$ is a set $S$ of vertices that is both a separating open code (that is, $N_G(u) \cap S \ne N_G(v) \cap S$ for all distinct vertices $u$ and $v$ in $G$) and a total dominating set (that is, $N(v) \cap S…

The famous Koecher-Vinberg theorem characterises the finite dimensional formally real Jordan algebras among the finite dimensional order unit spaces as the ones that have a symmetric cone. An alternative characterisation of symmetric cones…

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le…

Hadwiger's conjecture asserts that every graph without a $K_t$-minor is $(t-1)$-colorable. It is known that the exact version of Hadwiger's conjecture does not extend to list coloring, but it has been conjectured by Kawarabayashi and Mohar…

Denote by $\mathrm m(S)$ the multiplicity of a numerical semigroup $S$. A covariety is a nonempty family $\mathscr{C}$ of numerical semigroups that fulfills the following conditions: there is the minimum of $\mathscr{C},$ the intersection…