Results 31 to 40 of about 233 (111)
Weak, Strong and Mixed Extensions of Relations to Spaces of Ultrafilters
ABSTRACT The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers, focused mostly on congruences and divisions. We show that similar methods can be used to extend these characterizations to arbitrary relations and their interplay.
Leonardo Raffaello Maximilian Gasparro +1 more
wiley +1 more source
ABSTRACT We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski (2004). Vertices are attached sequentially, one by one, by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random.
Louigi Addario‐Berry +5 more
wiley +1 more source
Asymmetric Results About Graph Homomorphisms
ABSTRACT Many important results in extremal graph theory can be roughly summarized as “if a triangle‐free graph G$$ G $$ has certain properties, then it has a homomorphism to a triangle‐free graph Γ$$ \Gamma $$ of bounded size.” For example, bounds on homomorphism thresholds give such a statement if G$$ G $$ has sufficiently high minimum degree, and ...
Lior Gishboliner +2 more
wiley +1 more source
ABSTRACT Systems of interacting trajectories were recently studied in Hermann et al. (2025). Such a system of [0,1]$$ \left[0,1\right] $$‐valued piecewise linear trajectories arises as a scaling limit of the system of logarithmic subpopulation sizes in a population‐genetic model (more precisely, a Moran model) with mutation and selection. By definition,
Katalin Friedl +2 more
wiley +1 more source
The Role of Dice in the Emergence of the Probability Calculus
Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
The implications of generative artificial intelligence for mathematics education
Abstract Generative artificial intelligence has become prevalent in discussions of educational technology, particularly in the context of mathematics education. These AI models can engage in human‐like conversation and generate answers to complex questions in real‐time, with education reports accentuating their potential to make teachers' work more ...
Candace Walkington
wiley +1 more source
On a Ramsey–Turán variant of Roth's theorem
Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Cluster scattering diagrams via quiver moduli and tight gradings
Abstract We study rank‐2 cluster scattering diagrams through moduli spaces of quiver representations and a recently developed combinatorial framework of tight gradings. Combining quiver‐theoretic and combinatorial methods, we prove and extend a collection of conjectures posed by Elgin–Reading–Stella concerning the structural and enumerative properties ...
Amanda Burcroff +4 more
wiley +1 more source
Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties
Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley +1 more source
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source

