English
Related papers

Related papers: A Ramsey Theorem for Finite Monoids

200 papers

The real homology of a compact Riemannian manifold $M$ is naturally endowed with the stable norm. The stable norm on $H_1(M,\mathbb{R})$ arises from the Riemannian length functional by homogenization. It is difficult and interesting to…

Differential Geometry · Mathematics 2009-06-30 Madeleine Jotz

Let $M$ be an $mn\times mn$ matrix over a commutative ring $R$. Divide $M$ into $m \times m$ blocks. Assume that the blocks commute pairwise. Consider the following two procedures: (1) Evaluate the $n \times n$ determinant formula at these…

Rings and Algebras · Mathematics 2018-05-17 Nat Sothanaphan

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

Commutative Algebra · Mathematics 2023-07-04 Scott T. Chapman , Harold Polo

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…

Combinatorics · Mathematics 2013-05-14 Mirjam Friesen , Dirk Oliver Theis

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

Combinatorics · Mathematics 2019-03-06 Huan Xiong , Wenston J. T. Zang

For every one-relator monoid $M = \langle A \mid u=v \rangle$ with $u, v \in A^*$ we construct a contractible $M$-CW complex and use it to build a projective resolution of the trivial module which is finitely generated in all dimensions.…

Group Theory · Mathematics 2019-10-23 Robert D. Gray , Benjamin Steinberg

This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set whose patch-counting function N(T), for radius T, is finite for all T is…

Dynamical Systems · Mathematics 2007-05-23 Jeffery C. Lagarias , Peter A. B. Pleasants

For positive integers $u$ and $v$, let $L_u=\begin{bmatrix} 1 & 0 \\ u & 1 \end{bmatrix}$ and $R_v=\begin{bmatrix} 1 & v \\ 0 & 1 \end{bmatrix}$. Let $S_{u,v}$ be the monoid generated by $L_u$ and $R_v$, and $G_{u,v}$ be the group generated…

Group Theory · Mathematics 2020-11-10 Sandie Han , Ariane M. Masuda , Satyanand Singh , Johann Thiel

A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…

Combinatorics · Mathematics 2013-01-03 David Conlon , Jacob Fox , János Pach , Benny Sudakov , Andrew Suk

This paper studies algorithmic meta theorems for property testing with \emph{constant running time} in the bounded degree model. In (Adler, Harwath 2018) it was shown that on graph classes $\mathcal C^{w}_d$ consisting of all graphs with…

Logic in Computer Science · Computer Science 2026-05-12 Isolde Adler , Jenny Stimpson

For two positive integers $m$ and $M$, we study the Davenport constant of the interval of integers $[\![ -m,M ]\!]$, that is the maximal length of a minimal zero-sum sequence composed of elements from $[\![ -m,M ]\!]$. We prove the…

Number Theory · Mathematics 2026-01-14 Benjamin Girard , Alain Plagne

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…

Combinatorics · Mathematics 2014-04-30 Mano Vikash Janardhanan

Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey…

Logic in Computer Science · Computer Science 2020-01-15 Ronald de Haan , Jakub Szymanik

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Group Theory · Mathematics 2018-05-16 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

If $M$ is an atomic monoid and $x$ is a nonzero non-unit element of $M$, then the set of lengths $\mathsf{L}(x)$ of $x$ is the set of all possible lengths of factorizations of $x$, where the length of a factorization is the number of…

Commutative Algebra · Mathematics 2018-08-30 Marly Gotti

Let $R$ be a commutative Noetherian ring of dimension $d$, $M$ a commutative cancellative torsion-free monoid of rank $r$ and $P$ a finitely generated projective $R[M]$-module of rank $t$. $(1)$ Assume $M$ is $\Phi$-simplicial seminormal.…

Commutative Algebra · Mathematics 2022-04-18 Manoj K. Keshari , Husney Parvez Sarwar

We show that for each element $g$ of a Garside group, there exists a positive integer $m$ such that $g^m$ is conjugate to a periodically geodesic element $h$, an element with $|h^n|_\D=|n|\cdot|h|_\D$ for all integers $n$, where $|g|_\D$…

General Topology · Mathematics 2009-06-18 Eon-Kyung Lee , Sang-Jin Lee

The normalized maximum likelihood (NML) code length is widely used as a model selection criterion based on the minimum description length principle, where the model with the shortest NML code length is selected. A common method to calculate…

Statistics Theory · Mathematics 2024-09-16 Atsushi Suzuki , Kota Fukuzawa , Kenji Yamanishi

Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in…

Combinatorics · Mathematics 2007-05-23 David G. Wagner
‹ Prev 1 8 9 10 Next ›