AI Chat AI Image Generator AI Video Text to Speech

The characterization of (𝐧-1)-spheres with 𝐧+4 vertices having maximal Buchstaber number

01/02/2023

∙

by Suyoung Choi, et al.

∙

∙

We provide a GPU-friendly algorithm for obtaining all weak pseudo-manifolds whose facets are all in an input set of facets satisfying given conditions. We use it here to completely list up toric colorable seed PL-spheres with a few vertices implying the complete characterization of PL-spheres of dimension n-1 with n+4 vertices having maximal Buchstaber numbers.

Suyoung Choi
3 publications
Hyeontae Jang
1 publication
Mathieu Vallée
1 publication

page 1

page 2

page 3

page 4

research

∙ 12/13/2018

A characterization of claw-free CIS graphs and new results on the order of CIS graphs

A graph is CIS if every maximal clique interesects every maximal stable ...

0 Liliana Alcón, et al. ∙

research

∙ 09/02/2021

Ramsey Numbers of Trails

We initiate the study of Ramsey numbers of trails. Let k ≥ 2 be a positi...

0 Masatoshi Osumi, et al. ∙

research

∙ 06/23/2019

Dynamic Maximal Independent Set

Given a stream S of insertions and deletions of edges of an underlying g...

0 Morteza Monemizadeh, et al. ∙

research

∙ 09/03/2019

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem

The convex dimension of a k-uniform hypergraph is the smallest dimension...

0 Leonardo Martínez-Sandoval, et al. ∙

research

∙ 08/07/2022

The 2-center Problem in Maximal Outerplanar Graph

We consider the problem of computing 2-center in maximal outerplanar gra...

0 Hsiu-Fu Yeh, et al. ∙

research

∙ 08/04/2021

Maximum likelihood thresholds via graph rigidity

The maximum likelihood threshold (MLT) of a graph G is the minimum numbe...

0 Daniel Irving Bernstein, et al. ∙