English
Related papers

Related papers: Flag f-vectors of colored complexes

200 papers

We examine the topological characteristic cohomology classes of complexified vector bundles. In particular, all the classes coming from the real vector bundles underlying the complexification are determined.

K-Theory and Homology · Mathematics 2013-12-24 Alexander D. Rahm

A particle $\phi$ coupling to two photons couples also to charged particles, like protons, through a loop. If the particle is a light scalar this induced coupling to protons leads to non-newtonian forces. We show that the experimental…

High Energy Physics - Phenomenology · Physics 2008-11-26 Arnaud Dupays , Eduard Masso' , Javier Redondo , Carlo Rizzo

Let $X$ be a max-stable random vector with positive continuous density. It is proved that the conditional independence of any collection of disjoint sub-vectors of $X$ given the remaining components implies their joint independence. We…

Probability · Mathematics 2015-09-18 Ioannis Papastathopoulos , Kirstin Strokorb

For a given flag variety, we characterize the primes $p$ for which there exists a weight $\lambda$ such that the Hard Lefschetz Theorem holds for multiplication by $\lambda$ on the cohomology of the flag variety with coefficients in an…

Representation Theory · Mathematics 2021-09-29 Leonardo Patimo

A graph polynomial $P$ is weakly distinguishing if for almost all finite graphs $G$ there is a finite graph $H$ that is not isomorphic to $G$ with $P(G)=P(H)$. It is weakly distinguishing on a graph property $\mathcal{C}$ if for almost all…

Combinatorics · Mathematics 2020-10-21 Johann A. Makowsky , Vsevolod Rakita

For a compact group G, we give a sufficient condition for embedding one G-equivariant vector bundle into another one and for a stable isomorphism between two such bundles to imply an isomorphism. Our criteria involve multiplicities of…

K-Theory and Homology · Mathematics 2025-11-04 Malkhaz Bakuradze , Ralf Meyer

In spectral bisection, a Fielder vector is used for partitioning a graph into two connected subgraphs according to its sign pattern. In this article, we investigate graphs having Fiedler vectors with unbalanced sign patterns such that a…

Combinatorics · Mathematics 2023-04-13 Sooyeong Kim , Steve Kirkland

In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…

Combinatorics · Mathematics 2008-12-31 Amir Daneshgar , Roozbeh Ebrahimi Soorchaei

Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…

Data Structures and Algorithms · Computer Science 2016-03-24 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Vincenzo Roselli

We prove that a weak Fano manifold has unobstructed deformations. For a general variety, we investigate conditions under which a variety is necessarily obstructed.

Algebraic Geometry · Mathematics 2013-05-23 Taro Sano

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

Combinatorics · Mathematics 2007-05-23 Jonathan Fine

Type qualifiers offer a lightweight mechanism for enriching existing type systems to enforce additional, desirable, program invariants. They do so by offering a restricted but effective form of subtyping. While the theory of type qualifiers…

Programming Languages · Computer Science 2024-02-27 Edward Lee , Yaoyu Zhao , James You , Kavin Satheeskumar , Ondřej Lhoták , Jonathan Brachthäuser

An orientation preserving diffeomorphism over a surface embedded in a 4-manifold is called extendable, if this diffeomorphism is a restriction of an orientation preserving diffeomorphism on this 4-manifold. In this paper, we investigate…

Geometric Topology · Mathematics 2014-10-01 Susumu Hirose

In this paper, we explore the possibility of constructing the quantum chromodynamics of a massive color-octet vector field without introducing higher structures like extended gauge symmetries, extra dimensions or scalar fields. We show that…

High Energy Physics - Phenomenology · Physics 2013-05-09 Alfonso R. Zerwekh

We show that a nef line bundle on a proper scheme over an excellent base is semiample if and only if it is semiample after restricting to characteristic zero and to positive characteristic. In the process of the proof, we provide a…

Algebraic Geometry · Mathematics 2021-06-14 Jakub Witaszek

Let X be a normal variety such that $K_X$ is Q-Cartier, and let $f: X \rightarrow X$ be a finite surjective morphism of degree at least two. We establish a close relation between the irreducible components of the locus of singularities that…

Algebraic Geometry · Mathematics 2017-10-30 Amaël Broustet , Andreas Höring

Aharoni, Berger and Ziv recently proved the fractional relaxation of the strong colouring conjecture. In this note we generalize their result as follows. Let $k\geq 1$ and partition the vertices of a graph $G$ into sets $V_1,..., V_r$, such…

Discrete Mathematics · Computer Science 2014-10-13 Andrew D. King

Gauge-invariant field strengths, defined as parallel transports to infinity of ordinary field strengths, naturally emerge in a few physical phenomena governed by $QCD$. One of them is confinement of colour. Despite the arbitrariness in…

High Energy Physics - Lattice · Physics 2025-06-06 Adriano Di Giacomo

It is possible that fundamental constants may not be constant at all. There is a generally accepted view that one can only talk about variations of dimensionless quantities, such as the fine structure constant $\alpha_{\rm e}\equiv…

Cosmology and Nongalactic Astrophysics · Physics 2011-01-27 Adam Moss , Ali Narimani , Douglas Scott

Let $a_1, ..., a_s$ be positive integers. For a graph $G$ the expression $$ G \overset{v}{\rightarrow} (a_1, ..., a_s) $$ means that for every coloring of the vertices of $G$ in $s$ colors ($s$-coloring) there exists $i \in \{1, ..., s\}$,…

Combinatorics · Mathematics 2019-03-28 Aleksandar Bikov , Nedyalko Nenov
‹ Prev 1 4 5 6 7 8 10 Next ›