Results 181 to 190 of about 839,511 (260)

Abelian varieties of prescribed order over finite fields. [PDF]

open access: yesMath Ann
van Bommel R   +4 more
europepmc   +1 more source

Colourings of Uniform Group Divisible Designs and Maximum Packings

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess   +6 more
wiley   +1 more source

Algebraic Capsets

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT Capsets are subsets of F 3 n ${{\mathbb{F}}}_{3}^{n}$ with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3 ${{\mathbb{F}}}_{3}$.
Cassie Grace, José Felipe Voloch
wiley   +1 more source

The Variance-Gamma Product Distribution. [PDF]

open access: yesResults Math
Gaunt RE, Li S, Sutcliffe HL.
europepmc   +1 more source

On Finite Sums and Integral Representations [PDF]

open access: yes, 2013
Batir, Necdet, Sofo, Anthony
core  

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr   +3 more
wiley   +1 more source

Fractional List Packing for Layered Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Home - About - Disclaimer - Privacy