Related papers: A Ramsey Theorem for Finite Monoids

Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real…

We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some formulas. The extended framework is known to have…

We say that a 0-1 matrix $N$ of size $a\times b$ can be found in a collection of sets $\mathcal{H}$ if we can find sets $H_{1}, H_{2}, \dots, H_{a}$ in $\mathcal{H}$ and elements $e_1, e_2, \dots, e_b$ in $\cup_{H \in \mathcal{H}} H$ such…

For a finitely generated, non-free module $M$ over a CM local ring $(R,\fm,k)$, it is proved that for $n\gg 0$ the length of $\tor 1RM{R/\fm^{n+1}}$ is given by a polynomial of degree $\dim R-1$. The vanishing of $\tor iRM{N/\fm^{n+1}N}$ is…

A path $v_1,v_2,\ldots,v_m$ in a graph $G$ is $degree$-$monotone$ if $deg(v_1) \leq deg(v_2) \leq \cdots \leq deg(v_m)$ where $deg(v_i)$ is the degree of $v_i$ in $G$. Longest degree-monotone paths have been studied in several recent…

Let $(R,\mathfrak m)$ be a local (Noetherian) ring of dimension $d$ and $M$ a finite length $R$-module with free resolution $G_\bullet$. De Stefani, Huneke, and N\'{u}\~{n}ez-Betancourt explored two questions about the properties of…

In this paper, for an operator defined by the action of an M-th order differential operator with rational-type coefficients on the function space L_k^2(R):={f: measurable | \|f\|_k <\infty} with norm \|f\|_k^2:= \int |f(x)|^2 (x^2+1)^k dx…

Let H_1, ..., H_k be graphs. The multicolor Ramsey number r(H_1,...,H_k) is the minimum integer r such that in every edge-coloring of K_r by k colors, there is a monochromatic copy of H_i in color i for some 1 <= i <= k. In this paper, we…

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

In this paper, we study some of the factorization aspects of rational multicyclic monoids, that is, additive submonoids of the nonnegative rational numbers generated by multiple geometric sequences. In particular, we provide a complete…

In the context of (not necessarily minimal) actions, we consider the mean diameter and use it to characterize regular factor maps. Building on this characterization, we prove that an action is diam-mean equicontinuous if and only if it is a…

We initiate the study of the expansion $\mathcal{S}(M)$ of a monoid $M$ obtained via the semidirect product of $M$ acting naturally on the left of its power set (regarded as a semilattice under union). We term this the `subset expansion' of…

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

It is now well known that the performance of a linear code $C$ under iterative decoding on a binary erasure channel (and other channels) is determined by the size of the smallest stopping set in the Tanner graph for $C$. Several recent…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…