惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

人人都是产品经理
人人都是产品经理
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
雷峰网
雷峰网
Google DeepMind News
Google DeepMind News
Y
Y Combinator Blog
Microsoft Security Blog
Microsoft Security Blog
M
MIT News - Artificial intelligence
WordPress大学
WordPress大学
MongoDB | Blog
MongoDB | Blog
V
V2EX
博客园 - 【当耐特】
GbyAI
GbyAI
Stack Overflow Blog
Stack Overflow Blog
I
InfoQ
Martin Fowler
Martin Fowler
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Hugging Face - Blog
Hugging Face - Blog
B
Blog
V
Visual Studio Blog
D
DataBreaches.Net
C
Check Point Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
F
Fortinet All Blogs

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Orientation of good covers
Péter Ágoston, Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi · 2022-06-04 · via math.CO updates on arXiv.org

We study systems of orientations on triples that satisfy the following so-called interiority condition: $\circlearrowleft(ABD)=~\circlearrowleft(BCD)=~\circlearrowleft(CAD)=1$ implies $\circlearrowleft(ABC)=1$ for any $A,B,C,D$. We call such an orientation a P3O (partial 3-order), a natural generalization of a poset, that has several interesting special cases. For example, the order type of a planar point set (that can have collinear triples) is a P3O; we denote a P3O realizable by points as p-P3O. If we do not allow $\circlearrowleft(ABC)=0$, we obtain a T3O (total 3-order). Contrary to linear orders, a T3O can have a rich structure. A T3O realizable by points, a p-T3O, is the order type of a point set in general position. In our paper "Orientation of convex sets" we defined a 3-order on pairwise intersecting convex sets; such a P3O is called a C-P3O. In this paper we extend this 3-order to pairwise intersecting good covers; such a P3O is called a GC-P3O. If we do not allow $\circlearrowleft(ABC)=0$, we obtain a C-T3O and a GC-T3O, respectively. The main result of this paper is that there is a p-T3O that is not a GC-T3O, implying also that it is not a C-T3O -- this latter problem was left open in our earlier paper. Our proof involves several combinatorial and geometric observations that can be of independent interest. Along the way, we define several further special families of GC-T3O's.