English
Related papers

Related papers: Simultaneous generating sets for flags

200 papers

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag…

Representation Theory · Mathematics 2007-05-23 Evgeny Smirnov

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a linear space V under linear transformations of V; or equivalently, it describes the closure of an orbit of GL(V) acting diagonally on the…

Representation Theory · Mathematics 2007-05-23 Peter Magyar

We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…

Combinatorics · Mathematics 2009-06-18 Olivier Bernardi

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_1$, $M_2$, and $M_3$. Given such a graph $G$ and any $a_1,a_2,a_3\in \mathbb{N}$ with $a_1+a_2+a_3\leq n-2$, we show there exists a matching $M$ of $G$ with…

Combinatorics · Mathematics 2023-06-02 Michael Anastos , David Fabian , Alp Müyesser , Tibor Szabó

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

Combinatorics · Mathematics 2025-02-18 Dhruv Mubayi , Jozsef Solymosi

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

Group Theory · Mathematics 2024-05-28 Andrea Lucchini , Daniele Nemmi

We study the space of all triples of projective lines in $\mathbb{RP}^n$ such that any line in a triple intersects the two others at distinct points. We show that for $n=2$ and $3$ these spaces are homotopically equivalent to the real…

Algebraic Topology · Mathematics 2022-09-15 Ali Berkay Yetişer

We define the class of admissible linear embeddings of flag varieties. The definition is given in the general language of algebraic geometry. We then prove that an admissible linear embedding of flag varieties has a certain explicit form in…

Algebraic Geometry · Mathematics 2019-11-05 A. Tikhomirov , I. Penkov

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.

Number Theory · Mathematics 2025-10-31 Marija Bliznac Trebješanin

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

Combinatorics · Mathematics 2017-09-06 A. Gardiner , Cheryl E. Praeger

Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the…

Combinatorics · Mathematics 2017-07-31 Hamed Hatami , Jan Hladký , Daniel Král , Serguei Norine , Alexander Razborov

In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural…

Commutative Algebra · Mathematics 2008-03-28 Eric Emtander

For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…

Combinatorics · Mathematics 2025-01-22 A. Satyanarayana Reddy , Kavita Samant

For each $d\leq3$, we construct a finite set $F_d$ of multigraphs such that for each graph $H$ of girth at least $5$ obtained from a multigraph $G$ by subdividing each edge at least two times, $H$ has twin-width at most $d$ if and only if…

Combinatorics · Mathematics 2025-08-15 Jungho Ahn , Debsoumya Chakraborti , Kevin Hendrey , Sang-il Oum

We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…

Algebraic Geometry · Mathematics 2015-07-30 Sergey Finashin , Viatcheslav Kharlamov

Using Grothendieck's "functor of points" approach to algebraic geometry, we define a new infinite-dimensional algebro-geometric flag space as a $k$-functor (for $k$ a ring) which maps a $k$-algebra $R$ to the set of certain well-ordered…

Algebraic Geometry · Mathematics 2021-12-02 Nathaniel Gallup

We classify and construct all line graphs that are $3$-polytopes (planar and $3$-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., $3$-regular) $3$-polytopes, by applying two…

Combinatorics · Mathematics 2024-04-12 Phoebe Hollowbread-Smith , Riccardo W. Maffucci

Let a split element of a connected semisimple Lie group act on one of its flag manifolds. We prove that each connected set of fixed points of this action is itself a flag manifold. With this we can obtain the generalized Bruhat…

Group Theory · Mathematics 2008-07-29 Lucas Seco

Label the vertices of the complete graph $K_v$ with the integers $\{0, 1, \ldots, v-1\}$ and define the {\em length} $\ell$ of the edge between distinct vertices labeled $x$ and $y$ by $\ell(x,y) = \min( |y-x|, v - |y-x| )$. A {\em…

Combinatorics · Mathematics 2024-02-15 Onur Agirseven , M. A. Ollis
‹ Prev 1 2 3 10 Next ›