Results 81 to 90 of about 68,778 (203)

A Coding Theoretic Study on MLL proof nets

open access: yes, 2010
Coding theory is very useful for real world applications. A notable example is digital television. Basically, coding theory is to study a way of detecting and/or correcting data that may be true or false. Moreover coding theory is an area of mathematics,
Girard   +4 more
core   +1 more source

Conditioned Galton-Watson trees do not grow [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj   +1 more source

Dominating K t‐Models

open access: yesJournal of Graph Theory, Volume 110, Issue 4, Page 448-456, December 2025.
ABSTRACT A dominating K t‐model in a graph G is a sequence ( T 1 , … , T t ) of pairwise disjoint non‐empty connected subgraphs of G, such that for 1 ⩽ i < j ⩽ t every vertex in T j has a neighbour in T i. Replacing ‘every vertex in T j’ by ‘some vertex in T j’ retrieves the standard definition of K t‐model, which is equivalent to K t being a minor of ...
Freddie Illingworth, David R. Wood
wiley   +1 more source

Decomposition spaces in combinatorics [PDF]

open access: yes, 2016
A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada   +2 more
core   +1 more source

Pattern avoidance in dynamical systems [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
Orbits generated by discrete-time dynamical systems have some interesting combinatorial properties. In this paper we address the existence of forbidden order patterns when the dynamics is generated by piecewise monotone maps on one-dimensional closed ...
José María Amigó   +2 more
doaj   +1 more source

Real models for the framed little n$n$‐disks operads

open access: yesJournal of Topology, Volume 18, Issue 4, December 2025.
Abstract We study the action of the orthogonal group on the little n$n$‐disks operads. As an application we provide small models (over the reals) for the framed little n$n$‐disks operads. It follows in particular that the framed little n$n$‐disks operads are formal (over the reals) for n$n$ even and coformal for all n$n$.
Anton Khoroshkin, Thomas Willwacher
wiley   +1 more source

Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions

open access: yes, 2017
Boltzmann sampling is commonly used to uniformly sample objects of a particular size from large combinatorial sets. For this technique to be effective, one needs to prove that (1) the sampling procedure is efficient and (2) objects of the desired size ...
Bernstein, Megan   +2 more
core   +1 more source

An extension to overpartitions of Rogers-Ramanujan identities for even moduli [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
We investigate class of well-poised basic hypergeometric series $\tilde{J}_{k,i}(a;x;q)$, interpreting these series as generating functions for overpartitions defined by multiplicity conditions.
Sylvie Corteel   +2 more
doaj   +1 more source

Commuting Pairs in Quasigroups

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 11, Page 418-427, November 2025.
ABSTRACT A quasigroup is a pair ( Q , ∗ ), where Q is a nonempty set and ∗ is a binary operation on Q such that for every ( a , b ) ∈ Q 2, there exists a unique ( x , y ) ∈ Q 2 such that a ∗ x = b = y ∗ a. Let ( Q , ∗ ) be a quasigroup. A pair ( x , y ) ∈ Q 2 is a commuting pair of ( Q , ∗ ) if x ∗ y = y ∗ x.
Jack Allsop, Ian M. Wanless
wiley   +1 more source

A characterization of b-chromatic and partial Grundy numbers by induced subgraphs

open access: yes, 2016
Gy{\'a}rf{\'a}s et al. and Zaker have proven that the Grundy number of a graph $G$ satisfies $\Gamma(G)\ge t$ if and only if $G$ contains an induced subgraph called a $t$-atom.The family of $t$-atoms has bounded order and contains a finite number of ...
Effantin, Brice   +2 more
core   +4 more sources

Home - About - Disclaimer - Privacy