-saturated graphs of minimum size
-groups.
Cacti, braids and complex polynomials.
Calcolo della funzione di partizione di Kostant
Forniamo un calcolo esplicito della funzione di partizione di Kostant per algebre di Lie complesse di rango . La tecnica principale consiste nella riduzione a casi più semplici ed all'uso di funzioni generatrici.
Calcul du centralisateur d'un groupe de permutations
Calcul pratique du treillis de Galois d'une correspondance
Calculating the number of the linear factors in planar graphs.
Calculation of Rozansky-Witten invariants on the Hilbert schemes of points on a K3 surface and the generalised kummer varieties.
Cambrian fans
For a finite Coxeter group and a Coxeter element of ; the -Cambrian fan is a coarsening of the fan defined by the reflecting hyperplanes of . Its maximal cones are naturally indexed by the -sortable elements of . The main result of this paper is that the known bijection cl between -sortable elements and -clusters induces a combinatorial isomorphism of fans. In particular, the -Cambrian fan is combinatorially isomorphic to the normal fan of the generalized associahedron for . The rays...
Can Visibility Graphs Be Represented Compactly?.
Cancellation of direct products of digraphs
We investigate expressions of form A×C ≅ B×C involving direct products of digraphs. Lovász gave exact conditions on C for which it necessarily follows that A ≅ B. We are here concerned with a different aspect of cancellation. We describe exact conditions on A for which it necessarily follows that A ≅ B. In the process, we do the following: Given an arbitrary digraph A and a digraph C that admits a homomorphism onto an arc, we classify all digraphs B for which A×C ≅ B×C.
Canonical Brauer induction and symmetric groups
Imitating the approach of canonical induction formulas we derive a formula that expresses every character of the symmetric group as an integer linear combination of Young characters. It is different from the well-known formula that uses the determinantal form.
Canonical characters on quasi-symmetric functions and bivariate Catalan numbers.
Canonical characters on simple graphs
A multiplicative functional on a graded connected Hopf algebra is called the character. Every character decomposes uniquely as a product of an even character and an odd character. We apply the character theory of combinatorial Hopf algebras to the Hopf algebra of simple graphs. We derive explicit formulas for the canonical characters on simple graphs in terms of coefficients of the chromatic symmetric function of a graph and of canonical characters on quasi-symmetric functions. These formulas and...
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Canonical equivalence relations for parameter sets
Canonical ordering theorems, a first attempt
Canonical partition theorems for finite distributive lattices
Capacités de Choquet finies et profinies
On définit les capacités de Choquet dans le cas fini en utilisant une forme bilinéaire non dégénérée associée à la base de Choquet. On montre que, dans le cas fini, une capacité de Choquet est la donnée d’un convexe de mesure qu’on caractérise. Le cas profini, issu des arbres, est obtenu par passage à la limite projective du cas fini. Sur les capacités profinies, on définit une forme bilinéaire dont le rapport avec l’intégration, dans des cas simples, est étudié.
Capturing forms in dense subsets of finite fields
An open problem of arithmetic Ramsey theory asks if given an r-colouring c:ℕ → 1,...,r of the natural numbers, there exist x,y ∈ ℕ such that c(xy) = c(x+y) apart from the trivial solution x = y = 2. More generally, one could replace x+y with a binary linear form and xy with a binary quadratic form. In this paper we examine the analogous problem in a finite field . Specifically, given a linear form L and a quadratic form Q in two variables, we provide estimates on the necessary size of to guarantee...