Results 121 to 130 of about 46,626 (239)

Combinatorics of Periods in Strings

open access: yesJournal of Combinatorial Theory, Series A, 2001
A preliminary version of this article was published in Lect. Notes Comput. Sci. 2076, 615--626 (2001; Zbl 0986.68101).
Eric Rivals, Sven Rahmann
openaire   +4 more sources

Induced subarrays of Latin squares without repeated symbols

open access: yes, 2013
We show that for any Latin square L of order 2m, we can partition the rows and columns of L into pairs so that at most (m+3)/2 of the 2x2 subarrays induced contain a repeated symbol.
Kuhl, Jaromy   +2 more
core  

Combinatorics and connectionism

open access: yesDiscrete Mathematics, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Combinatorics on ideals and axiom A [PDF]

open access: yesJournal of Symbolic Logic, 1994
Throughout this paper denotes a nonprincipal ultrafilter and ℐ denotes the dual ideal. ℙ(ℐ) is the poset of all partial functions p: ω → 2 such that dom(p) ∈ ℐ. In [2], Grigorieff proved that ω1 is preserved in the corresponding generic extension if and only if is a P-point.
openaire   +3 more sources

Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight

open access: yesExperimental Physiology, EarlyView.
Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley   +1 more source

ABA and the combinatorics of morphological features

open access: yes, 2018
In several three cell paradigms, it has been observed that one logically conceivable pattern – ABA under some arrangement of cells – is unattested. Existing approaches assume that such *ABA generalizations provide evidence for feature inventories which ...
J. Bobaljik, U. Sauerland
semanticscholar   +1 more source

Combinatorics 79,

open access: yes, 1980
Combinatorics 79. Part II.Includes bibliographical references.Print version record.Front Cover; Annals of Discrete Mathematics Combinatorics 79, Part II; Copyright Page; Contents; Chapter 1. Centers of 2-trees; Chapter 2.
Deza, M., Rosenberg, I. G.(Ivo G.),
core  

On the automorphisms of the power semigroups of a numerical semigroup

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley   +1 more source

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

open access: yesJTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik   +5 more
doaj   +1 more source

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley   +1 more source

Home - About - Disclaimer - Privacy