English
Related papers

Related papers: Some combinatorial properties of flag simplicial p…

200 papers

Stable compact minimal submanifolds of the product of a sphere and any Riemannian manifold are classified whenever the dimension of the sphere is at least three. The complete classification of the stable compact minimal submanifolds of the…

Differential Geometry · Mathematics 2010-12-06 Francisco Torralbo , Francisco Urbano

We give a necessary and sufficient condition for two real flag manifolds, which are not necessarily congruent, in a complex flag manifold to intersect transversally in terms of the symmetric triad. Then we show that the intersection of two…

Differential Geometry · Mathematics 2025-07-18 Osamu Ikawa , Hiroshi Iriyeh , Takayuki Okuda , Takashi Sakai , Hiroyuki Tasaki

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

Combinatorics · Mathematics 2026-02-04 Iliyas Noman , Yuan Yao

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

Combinatorics · Mathematics 2007-05-23 Christian Haase , Günter M. Ziegler

For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we show that if the diameter of $\Delta(G)$ is equal to three, then the complement…

Group Theory · Mathematics 2019-09-10 Mahdi Ebrahimi

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Combinatorics · Mathematics 2023-07-07 Benjamin Braun , Kaitlin Bruegge

A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each of its component is a star. Clearly, every graph without isolated vertices has a star factor. A graph $G$ is called {\it star-uniform} if all star-factors of…

Combinatorics · Mathematics 2007-07-03 Mikio Kano , Yunjian Wu , Qinglin Yu

The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…

Algebraic Geometry · Mathematics 2014-03-18 Tommaso de Fernex , János Kollár , Chenyang Xu

Motivated from the surrounding property of a point set in $\mathbb{R}^d$ introduced by Holmsen, Pach and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As an attempt to give a lower bound for the…

Combinatorics · Mathematics 2023-07-25 Joseph Briggs , Michael Gene Dobbins , Seunghun Lee

Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…

Algebraic Topology · Mathematics 2024-11-08 Thomas Chaplin , Heather A. Harrington , Ulrike Tillmann

Flag manifolds are in general not symmetric spaces. But they are provided with a structure of $\mathbb{Z}_2^k$-symmetric space. We describe the Riemannian metrics adapted to this structure and some properties of reducibility. We detail for…

Differential Geometry · Mathematics 2012-04-12 Paola Piu , Elisabeth Remm

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…

Geometric Topology · Mathematics 2007-05-23 Michel Deza , Mathieu Dutour , Mikhail Shtogrin

A compact 4-dimensional manifold is a non-singular graph-manifold if it can be obtained by the glueing T^2-bundles over compact surfaces (with boundary) of negative Euler characteristics. If none of glueing diffeomorphisms respect the…

Geometric Topology · Mathematics 2014-10-01 A. Mozgova

We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…

Combinatorics · Mathematics 2023-08-11 Michaela Coleman , Anton Dochtermann , Nathan Geist , Suho Oh

The aim of this paper is to classify all invariant generalized complex structure on a partial flag manifold $\mathbb{F}_\Theta$ with at most four isotropy summands. To classify them all we proved that an invariant generalized almost complex…

Differential Geometry · Mathematics 2023-04-20 Carlos A. B. Varea

In 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of simplicial spheres. He proved that, for any simplicial complex $\Delta$ on the vertex set $V$ with $\Delta \ne 2^V$, the deleted join of $\Delta$ with…

Combinatorics · Mathematics 2011-05-10 Satoshi Murai

A flag domain is an open real group orbit in a complex flag manifold. It has been shown that a flag domain is either pseudoconvex or pseudoconcave. Moreover, generically 1-connected flag domains are pseudoconcave. In this study, for flag…

Complex Variables · Mathematics 2022-12-29 Tatsuki Hayama

Let $G$ be the group scheme $\operatorname{SL}_{d+1}$ over $\mathbb{Z}$ and let $Q$ be the parabolic subgroup scheme corresponding to the simple roots $\alpha_{2},\cdots,\alpha_{d-1}$. Then $G/Q$ is the $\mathbb{Z} $-scheme of partial flags…

Representation Theory · Mathematics 2020-10-12 Linyuan Liu

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…

Metric Geometry · Mathematics 2017-03-16 Seonhwa Kim , Yunhi Cho

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…

Combinatorics · Mathematics 2016-11-22 Antonio Breda d'Azevedo , Rui Duarte
‹ Prev 1 8 9 10 Next ›