Results 21 to 30 of about 113 (106)
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders it is required that the number of edges between any pair of sufficiently large sets is close to the expected ...
Gavinsky, Dmitry, Pudlák, Pavel
openaire +7 more sources
Plane Partitions as Sums over Partitions
In this paper, we consider complete homogeneous symmetric functions and provide a new formula for the number of plane partitions of n. This formula expresses the number of plane partitions of n in terms of binomial coefficients as a sum over all the partitions of n, considering the multiplicity of the parts greater than one.
Mircea Merca, Iulia-Ionelia Radu
openaire +1 more source
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
Protasov, I., Slobodianiuk, S.
openaire +3 more sources
Abstract This systematic review analyses 32 studies published between 2013 and 2024 on the Mathematics Teacher's Specialised Knowledge (MTSK) model, with the aim of understanding its theoretical development, practical applications and contributions to teacher education in secondary and pre‐university contexts.
Daniel Martín‐Cudero
wiley +1 more source
Partition Statistics for Cubic Partition Pairs [PDF]
In this brief note, we give two partition statistics which explain the following partition congruences: \begin{align*} b(5n+4) &\equiv 0 \pmod{5}, \\ b(7n+a) &\equiv 0 \pmod{7}, \text{if $a=2$, $3$, $4$, or $6$}. \end{align*} Here, $b(n)$ is the number of $4$-color partitions of $n$ with colors $r$, $y$, $o$, and $b$ subject to the ...
openaire +2 more sources
Expletive Constructions and Agreement in Labeling Theory
ABSTRACT In this paper, I explain how agreement occurs in English expletive constructions, in accord with recent work in the Minimalist Program. I develop a proposal that relies on feature unification and probe‐goal agreement, as well as the notion that internal merge of arguments generally applies freely.
Jason Ginsburg
wiley +1 more source
Abstract By definition, a partition of a list is a division of that list into nonempty contiguous segments. Many programming and operations research problems can be specified in terms of list partitions, and we present a hierarchy of theorems for deriving programs from such specifications.
Bird, R, de Moor, O
openaire +1 more source
Lability in Hittite and Indo‐European: A Diachronic Perspective
ABSTRACT Lability is defined as the possibility of a verb to enter a valency alternation without undergoing any change in its form. Labile verbs were common in ancient Indo‐European languages, including Hittite, which mostly features anticausative lability, with reflexive and reciprocal lability being less prominent.
Guglielmo Inglese
wiley +1 more source
French de nominals and Russian non-canonical genitives. Are they partitive-like nominal expressions?
The main goal of this paper is to provide a unified analysis of de nominals in French and noncanonical genitive nominals in Russian. Unlike previous literature that relies on partitivity, quantification and case assignment, we argue that a unified ...
Sonia Cyrino, M.Teresa Espinal
doaj +1 more source
The Nature, Structure, and Perception of Illumination
ABSTRACT Illumination is a defining characteristic of natural environments, yet its nature and spatial structure remain poorly understood. I argue first that illumination is not simply light: it is an emergent, ecologically significant kind. Illumination has features not possessed by light, and contains self‐organizing structures that persist through ...
Will Davies
wiley +1 more source

