Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
6
votes
2
answers
1k
views
Remarkable applications of Dickson's lemma
Dickson's lemma states that, for a fixed $k \in \mathbf N^+$, every set of $k$-tuples of natural numbers has finitely many elements that are minimal with respect to the product order induced on $\math …
2
votes
1
answer
231
views
Looking for a paper of Kemperman on semigroups
I like Shakespeare and Greek tragedy, so let me word it as I'm doing: I desperately need J.H.B. Kemperman's 1956 paper On complexes in a semigroup, but the online archive of Indagationes Mathematicae, …
3
votes
Minimal size of subsets $A,B$ in a finite group $G$ such that $AB=G$
I don't know how interesting my answer can be after a comment by Ben Green, but this would be too long for a comment, and I hope it can be helpful, somehow.
Your question is tightly related to the b …
1
vote
0
answers
95
views
The semicat of morphisms which are neither right nor left invertible
Given a cat $\bf C$, the class $\mathcal{S}$ of all $\mathbf{C}$-morphisms that are neither left nor right invertible, generates a "genuine" subsemicat $\bf S$ of $\bf C$ (if necessary, see here for t …
2
votes
Conditions for an analogue of Cauchy-Davenport for simple groups
Not sure whether @David is still around here, but I'd like to add a complement to @quid's answer.
Fix an integer $n \ge 9$, and let $q$ be a prime power and $\mathbb G = (G, \cdot)$ the projective s …
12
votes
2
answers
976
views
Higman's lemma and a manuscript of Erdős and Rado
Motivated by a problem in factorization theory, I've recently proved the following:
Theorem. If $X$ is a non-empty finite alphabet and $\mathcal W$ an infinite subset of the free semigroup, $X^\as …
4
votes
Accepted
Maximal zero-sum free sequences of $C_3^n$
I sent an email to Alfred Geroldinger with a link to this thread. Here is a summary of his reply (I'm posting with his permission):
The structure of minimal zero-sum sequences of maximal length over …
2
votes
Conjecture about commutative semigroups
As a complement to my previous non-answer, let me show that the OP's conjecture holds for any order-$3$ commutative semigroup $S$ that is not a group (equivalently, that is not a cyclic group of order …
4
votes
Conjecture about commutative semigroups
This is not an answer, but it's too long for a comment: I'm going to show that the OP's conjecture is true in some (admittedly, rather special) cases. It is hoped that this will help to find a counter …
6
votes
sum-sets in a finite field
I first learned about this problem from Éric Balandraud (in 2013). So I wrote to him a couple of days ago, and he has just sent me an e-mail explaining that the question dates back (at least) to 1971. …
3
votes
Structures that turn out to exhibit a symmetry even though their definition doesn't
I would like to add an example coming from the area of additive theory known as Freiman's structure theory. If I am not (too) blind, this has not been mentioned yet, and hopefully it qualifies as an …
2
votes
1
answer
218
views
A categorical framework for Freiman s-morphisms
Let $\mathfrak A_i$ be groups ($i = 1, 2$), written multiplicatively, and $s$ a non-negative integer (here, as usual, I am abusing notation and denoting the operations of $\mathfrak A_1$ and $\mathfra …
3
votes
1
answer
179
views
Decomposing a set of integers as a union of well-separated (discrete) intervals
Let a discrete interval be a set of the form $\{x \in \mathbb Z \colon a \le x \le b\}$ with $a, b \in \mathbb Z \cup \{\pm \infty\}$. Then define the boxing dimension $\text{bim}(S)$ of a set $S \sub …
0
votes
binomial/factorial identity mod p
As for references, you may want to give a look at the introduction and Section 2.2 of R. Meštrović's survey/preprint on Lucas's theorem (on arXiv).
2
votes
0
answers
116
views
Isomorphic subcategories of directed graphs and presets
For the purposes of this post, a digraph (directed graph) has neither loops nor multiple parallel edges, and a preset is an ordered pair consisting of a set $S$ and a preorder (viz., a reflexive and t …