Results 71 to 80 of about 2,909 (193)
Pattern classes of permutations via bijections between linearly ordered sets [PDF]
, 2008 A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e.
Ruškuc, Nik +2 more
core +1 more source
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of $\textit{Self-Organized Criticality}$. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain moving ...
Kévin Perrot +2 more
doaj +1 more source
Linear Versus Centred Colouring via Pseudogrids
Journal of Graph Theory, Volume 113, Issue 3, Page 448-461, November 2026.ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique.
Prosenjit Bose +4 more
wiley +1 more source
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2011 Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source
Jurnal ElemenCombinatorics is widely regarded as difficult, yet most studies stop at classifying student errors without explaining their internal structures. This study reframed epistemological obstacles in combinatorial counting principles as praxeological gaps ...
Marhami Marhami +3 more
doaj +1 more source
Around the root of random multidimensional quadtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source
Utterance evolution: the road to generative, combinatorial communicators
Biological Reviews, Volume 101, Issue 5, Page 2427-2447, October 2026.ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford +2 more
wiley +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj +1 more source
Journal of Combinatorial Designs, Volume 34, Issue 10, Page 459-463, October 2026.ABSTRACT Capsets are subsets of 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. In particular we construct the smallest known complete capsets with size proportional to the best known lower bound.
Cassie Grace, José Felipe Voloch
wiley +1 more source
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett +5 more
doaj +1 more source