Related papers: Flag f-vectors of colored complexes
In this paper, we consider categories with colored morphisms and functors such that morphisms assigned to morphisms with a common color have a common color. In this paper, we construct a morphism-colored functor such that any…
We prove that under certain assumptions a supermanifold of flags is rigid, this is its complex structure does not admit any non-trivial small deformation. Moreover under the same assumptions we show that a supermanifold of flags is unique…
A strong coloring on a cardinal $\kappa$ is a function $f:[\kappa]^2\to \kappa$ such that for every $A\subseteq \kappa$ of full size $\kappa$, every color $\gamma<\kappa$ is attained by $f\upharpoonright[A]^2$. The symbol…
A graph is $\ell$-choosable if, for any choice of lists of $\ell$ colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its list. We study complexity issues of choosability of graphs…
We study $f$-vectors, which are the maximal degree vectors of $F$-polynomials in cluster algebra theory. For a cluster algebra is of finite type, we find that positive $f$-vectors correspond with $d$-vectors, which are exponent vectors of…
A {\em strong edge coloring} of a graph is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} of a graph is the minimum number of colors needed to obtain a strong edge coloring. In an…
We give a complete combinatorial characterization of weakly $d$-Tverberg complexes. These complexes record which intersection combinatorics of convex hulls necessarily arise in any sufficiently large general position point set in $\mathbb…
Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…
We study Fox colorings of tangle diagrams by $R=\mathbb{Z}$ or $\mathbb{Z}/p\mathbb{Z}$, where $p\geq3$ is an odd integer. For an $R$-colored $m$-string tangle diagram, the colors at the $2m$ boundary points form a vector $v\in R^{2m}$. We…
A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not mapped to the same color. This constraint may be interpreted in terms of the distance between to vertices and so a…
In this note, we characterise the existence of non-trivial invariant spinors on maximal flag manifolds associated to complex simple Lie algebras. This characterisation is based on the combinatorial properties of their set of positive roots.…
One of the most common and effective methods of obtaining structural information on simplicial complexes is to use tools from algebraic geometry/commutative algebra (often motivated by properties of toric varieties). However, there is no…
There are given conditions for represention of a function of many arguments as the difference of convex functions.
We prove that localization functors of crossed modules of groups do not always admit fiberwise (or relative) versions. To do so we characterize the existence of a fiberwise localization by a certain normality condition and compute explicit…
We call a flag variety admissible if its automorphism group is the projective general linear group. (This holds in most cases.) Let $K$ be a field of characteristic $0$, containing all roots of unity. Let the $K$-variety $X$ be a form of an…
For any semifield K we define a K-form of a partial flag manifold of a semisimple group G of simply laced type over the complex numbers. The definition is in terms of the theory of canonical bases.
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…
Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we propose (for the first time) a notion of…
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of…
In this paper we obtain new sufficient conditions for representation of a function as an absolutely convergent Fourier integral. Unlike those known earlier, these conditions are given in terms of belonging to weighted spaces. Adding weights…