首页/论文/2012.05171

arXiv 2012.051712020-12-09math.COmath.CTmath.GRmath.RA

Germs in a poset

Serge Bouc

英文摘要：

Motivated by the theory of correspondence functors, we introduce the notion of {\em germ} in a finite poset, and the notion of {\em germ extension} of a poset. We show that any finite poset admits a largest germ extension called its {\em germ closure}. We say that a subset $U$ of a finite lattice $T$ is {\em germ extensible} in $T$ if the germ closure of $U$ naturally embeds in $T$. We show that any for any subset $S$ of a finite lattice $T$, there is a unique germ extensible subset $U$ of $T$ such that $U\subseteq S\subseteq \overline{G}(U)$, where $\overline{G}(U)\subseteq T$ is the embedding of the germ closure of $U$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Induced and non-induced poset saturation problems

A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$. In the case where in addition $p\le_P q$ holds if and only if $i(p)\subseteq i(q)$, then $\mathcal{G}$ is an induced (strong) copy of $P$ in $\mathcal{F}$. We consider the minimum number $sat(n,P)$ [resp.\ $sat^*(n,P)$] of sets that a family $\mathcal{F}\subseteq 2^{[n]}$ can have without containing a non-induced [induced] copy of $P$ and being maximal with…

2022-07-26math.CO

Containments in families with forbidden subposets

We consider the problem of determining the maximum number of pairs $F\subseteq F'$ in a family $\mathcal{F}\subseteq 2^{[n]}$ that avoids certain posets $P$ of height 2. We show that for any such $P$ the number of pairs is $O(n\binom{n}{\lfloor n/2\rfloor})$ and we find the exact value for the butterfly poset and the $N$ poset. Also, we determine the asymptotics of the maximum number of pairs in containment for some posets of which the Hasse diagram is a path.

2021-11-16math.CO

Generalized forbidden subposet problems

A subfamily $\{F_1,F_2,\dots,F_{|P|}\}\subseteq {\cal F}$ of sets is a copy of a poset $P$ in ${\cal F}$ if there exists a bijection $ϕ:P\rightarrow \{F_1,F_2,\dots,F_{|P|}\}$ such that whenever $x \le_P x'$ holds, then so does $ϕ(x)\subseteq ϕ(x')$. For a family ${\cal F}$ of sets, let $c(P,{\cal F})$ denote the number of copies of $P$ in ${\cal F}$, and we say that ${\cal F}$ is $P$-free if $c(P,{\cal F})=0$ holds. For any two posets $P,Q$ let us denote by $La(n,P,Q)$ the maximum number of copies of $Q$ over all $P$-free families ${\cal F} \subseteq 2^{[n]}$, i.e. $\max\{c(Q,{\cal F}): {\cal…

2017-08-07math.CO

两个偏序集多面体是突变等价的

Two poset polytopes are mutation-equivalent

Osaka University（大阪大学）

本文扩展组合突变至有理尖点多面体，并证明同一偏序集的序多面体与链多面体可通过突变序列相互转化，即突变等价。

2026-09-30math.CO

反拉姆齐禁止偏序问题

Anti-Ramsey forbidden poset problems

HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利科学院阿尔弗雷德·雷尼数学研究所）

研究反拉姆齐数ar(n,P)和ar*(n,P)，确定在2^[n]着色中不包含彩虹弱或强偏序复制的最大颜色数，连接到极值数La(n,P)和La*(n,P)，确定所有树偏序T和所有冠偏序O_{2k}的渐近ar*(n,T)和ar*(n,O_{2k})。

2026-07-07math.CO

Circular Peaks and Hilbert Series

The circular peak set of a permutation $σ$ is the set $\{σ(i)\mid σ(i-1)<σ(i)>σ(i+1)\}$. Let $\mathcal{P}_n$ be the set of all the subset $S\subseteq [n]$ such that there exists a permutation $σ$ which has the circular set $S$. We can make the set $\mathcal{P}_n$ into a poset $\mathscr{P}_n$ by defining $S\preceq T$ if $S\subseteq T$ as sets. In this paper, we prove that the poset $\mathscr{P}_n$ is a simplicial complex on the vertex set $[3,n]$. We study the $f$-vector, the $f$-polynomial, the reduced Euler characteristic, the M$\ddot{o}$bius function, the $h$-vector and the $h$-polynomial of…

2008-06-05math.CO

更多相关论文收起更多论文

Supersaturation, counting, and randomness in forbidden subposet problems

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area states that for any finite poset $P$ there exists an integer $e(P)$ such that $La(n,P)=(e(P)+o(1))\binom{n}{\lfloor n/2\rfloor}$. In this paper, we formulate three strengthenings of this conjecture and prove them for some specific classes of posets. (The parameters $x(P)$ and $d(P)$ are defined in the paper.) $\bullet$ For any finite connected poset $P$ and $\va…

2020-07-14math.CO

On the number of containments in $P$-free families

A subfamily $\{F_1,F_2,\dots,F_{|P|}\}\subseteq \mathcal F$ is a copy of the poset $P$ if there exists a bijection $i:P\rightarrow \{F_1,F_2,\dots,F_{|P|}\}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$. A family $\mathcal F$ is $P$-free, if it does not contain a copy of $P$. In this paper we establish basic results on the maximum possible number of $k$-chains in a $P$-free family $\mathcal F\subseteq 2^{[n]}$. We prove that if the height of $P$, $h(P) > k$, then this number is of the order $Θ(\prod_{i=1}^{k+1}\binom{l_{i-1}}{l_i})$, where $l_0=n$ and $l_1\ge l_2\ge \dots \ge l_{k+1}$ are…

2018-04-04math.CO

On Structural Decompositions of Finite Frames

A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\{f_i\}_{i\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\{f_i\}_{i\in I}$ is said to be scalable if there exist nonnegative scalars $\{c_i\}_{i\in I}$ such that $\{c_if_i\}_{i\in I}$ is a tight frame. In this paper we study the combinatorial structure of frames and their decomposition into tight or scalable subsets by using partially-ordered sets (posets). We define the factor poset of a frame $\{f_i\}_{i\in I}$ to be a collection of subsets of $I$…

2014-11-22math.COmath.FA

关于禁止子偏序集的彩虹Turán问题

Rainbow Turán problems for forbidden subposets

HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利科学院阿尔弗雷德·雷尼数学研究所）

研究禁止子偏序集问题的彩虹版本，通过偏序集彩虹强制建立$La^*$与$La^*_R$函数联系，确定树形偏序集的$La_R^*(n,T)$渐近性质，还得到反链和完全二分偏序集相关结果。

2026-07-27math.CO

组合神经码的覆盖关系

Covering Relations in the Poset of Combinatorial Neural Codes

本文研究了组合神经码的覆盖关系，探讨了凸神经码的实现问题，并提出了关于凸神经码与多面体凸神经码等价性的猜想。

2025-12-03math.COq-bio.NC

对角偏序集拉姆齐数

Diagonal poset Ramsey numbers

本文研究布尔格上的对角偏序集拉姆齐数，将 $R(Q_n,Q_n)$ 的上界改进为 $n^2-(1-o(1))n\log n$，并确定 $n$-叉和 $n$-菱形的对角拉姆齐数（误差至多2），同时证明弱版本上界 $0.96n^2$。

2024-02-20math.CO

A class of graphs approaching Vizing's conjecture

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written $γ(G)$. In 1963, V.G. Vizing conjectured that $γ(G \square H) \geq γ(G)γ(H)$ where $\square$ stands for the Cartesian product of graphs. In this note, we define classes of graphs $\mathcal{A}_n$, for $n\geq 0$, so that every graph belongs to some such class, and $\mathcal{A}_0$ corresponds to class $A$ of Bartsalkin and German. We prove that for any graph $G$ in…

2016-04-04math.CO