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 |
Results tagged with co.combinatorics
Search options not deleted
user 2083
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
7
votes
1
answer
297
views
Set of points covered by subspaces of small dimensions
Let $S \subset \mathbb R^d$ be finite set of points. We say that $S$ is $2$-covered if $S$ lies in a union $V_1\cup V_2$ of affine subspaces such that $\dim(V_1)+\dim (V_2)\leq d-1$. For example, if $ …
16
votes
6
answers
2k
views
Sum of $n$ vectors in $(\mathbb Z/n)^k$
Let $n,k$ be positive integers. What is the smallest value of $N$ such that for any $N$ vectors (may be repeated) in $(\mathbb Z/(n))^k$, one can pick $n$ vectors whose sum is $0$?
My guess is $N=2^ …
8
votes
1
answer
615
views
When is a triangulation of sphere two-colorable?
Let $T$ be a triangulation of sphere. We say that $T$ is $k$-colorable if the triangles of $T$ can be assigned with $k$ colors such that any two triangles with a common edge have different colors.
I a …
19
votes
4
answers
865
views
Size of sets with complete double
Let $[n]$ denote the set $\{0,1,...,n\}$. A subset $S\subseteq [n]$ is said to have complete double if $S+S=[2n]$. Let $m(n)$ be the smallest size of a subset of $[n]$ with complete double. My questio …
8
votes
Alternating sum over collections closed under containment
There is an interpretation of your inequality using simplicial complex and $h$-vector. Namely, let $\Delta$ be the set of all $P-S$ with $S$ in your set. Then $\Delta$ is a collection closed under inc …
6
votes
Accepted
A proper definition of connectivity for hypergraphs
Think of the hypergraph as a simplicial complex $\Delta$, with the facets being the hyperedges. Consider property (*) as:
1) The $i$-skeleton of $\Delta$ is full for $0\leq i\leq k-2$ and
2) $\ …
4
votes
0
answers
155
views
Inequalities about tripling and doubling sumsets
Let $A$ be a set of vectors in $\mathbb Z^d$ who $\mathbb R$-span is the whole $\mathbb R^d$. Let $s_i(A)$ denote the size of $A+A+\dots A$ ($i$ times). I am interested in the following:
Question …
5
votes
1
answer
388
views
Criterion for acyclicity of flag complexes
Let $\Delta$ be a flag complex on $n$ vertices. Let $r$ be the smallest size of the facets of $\Delta$. Suppose that $2r>n$. Must $\Delta$ be acyclic?
8
votes
Accepted
Definition of packing property
That Def 1 and Def 2 are equivalent is a well-known Conjecture, still open as far as I know. Curiously, you can translate the whole conjecture to the language of commutative algebra, see for example p …
8
votes
Diameter of simplicial complex mirrored in property of Stanley-Reisner ring?
Interestingly enough, there have been quite a few recent attempts at answering your question. First, some relevant background. The diameter that you defined is known as the diameter of the dual graph …
1
vote
1
answer
460
views
The number of hyperplanes determining the integer points of a polyhedron
This question is inspired by this one.
Let $P \subset \mathbb R_{+}^n$ be a convex polyhedron whose complement in $\mathbb R_{+}^n$ has finite volume. Let $Int(P) = P \cap \mathbb N^n$. (For motivatio …
16
votes
3
answers
1k
views
What to do when your research runs into a computationally challenging problem?
Occasionally, but more frequently lately, I would like to perform some hard computations. As an example, yesterday the following question came up:
What is the projective dimension of the edge idea …
5
votes
1
answer
631
views
Upper bounds on number of vertices of graphs whose complements has no induced cycles of cert...
Let $G$ be a finite, simple, undirected, connected graph. Suppose that $G$ has maximal degree $d$ and the complement $G^c$ has no induced cycles of lengths $i$, for $4 \leq i \leq l$. My question is: …
10
votes
1
answer
592
views
Condition for existence of certain lattice points on polytopes
Let $a_1,\cdots, a_n$ be integers such that $a_i\geq 2$ for all $i$ and $k>0$ another integer.
I am interested in whether there exist integers $x_1,\cdots, x_n$ with $0<x_i<a_i$ satisfying:
$$ \fra …