Skip to main content
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
Search options not deleted user 24563

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

0 votes
Accepted

Removing the symmetry maps from a small category of cubes

The naive idea has to be slightly modified. The point is not to sort out all terms (it is a wrong intuition), but only where the variables $x_i$ are "alone". For example, the map $$(x_1,x_2,x_3,x_4)\m …
Philippe Gaucher's user avatar
3 votes
1 answer
186 views

Removing the symmetry maps from a small category of cubes

Let $[1]^n=\{0<1\}^n$ equipped with the product order. I consider the small category $\widehat{\square}$ of the category of partially ordered sets generated by the coface maps $\delta^\epsilon_i:[1]^{ …
Philippe Gaucher's user avatar
1 vote
Accepted

How to describe this set of maps of posets?

I have found a way published in a recent preprint (https://doi.org/10.48550/arXiv.2209.02667). Theorem: Let $n\geq 1$. Let $f=(f_1,\dots,f_n):[n]\to [n]$ be a stricly increasing map. Then there is th …
Philippe Gaucher's user avatar
2 votes
1 answer
233 views

How to describe this set of maps of posets?

Let $n\geq 1$. Let $[n]=\{0<1\}^n$ equipped with the product order. Let $f:[n]\to [n]$ be a strictly increasing map. When $f$ is bijective, there exists a permutation $\sigma$ of $\{1,\dots,n\}$ such …
Philippe Gaucher's user avatar
1 vote
1 answer
242 views

About the $n$-cube

$[n]$ is the set $\{0,1\}^n$ equipped with the product order $(\epsilon_1,\dots,\epsilon_n) \leq (\eta_1,\dots,\eta_n)$ if and only if $\forall i=1,\dots,n$, $\epsilon_i \leq \eta_i$. Let $$d((\epsilo …
Philippe Gaucher's user avatar