Results 31 to 40 of about 488 (181)
WIREs Computational Statistics, Volume 17, Issue 2, June 2025.A four‐run orthogonal array for three two‐level factors. ABSTRACT Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and beautiful mathematical theory.
C. Devon Lin, John Stufken
wiley +1 more source
On an Erdős similarity problem in the large
Bulletin of the London Mathematical Society, Volume 57, Issue 6, Page 1801-1818, June 2025.Abstract In a recent paper, Kolountzakis and Papageorgiou ask if for every ε∈(0,1]$\epsilon \in (0,1]$, there exists a set S⊆R$S \subseteq \mathbb {R}$ such that |S∩I|⩾1−ε$\vert S \cap I\vert \geqslant 1 - \epsilon$ for every interval I⊂R$I \subset \mathbb {R}$ with unit length, but that does not contain any affine copy of a given increasing sequence ...
Xiang Gao +2 more
wiley +1 more source
C-Finite Sequences and Riordan Arrays
MathematicsMany prominent combinatorial sequences, such as the Fibonacci, Lucas, Pell, Jacobsthal and Tribonacci sequences, are defined by homogeneous linear recurrence relations with constant coefficients.
Donatella Merlini
doaj +1 more source
Mathematical Methods in the Applied Sciences, Volume 48, Issue 8, Page 9241-9252, 30 May 2025.ABSTRACT The motivation of this paper is to explore and generalize Sakaguchi‐type functions, which play a significant role in geometric function theory. In this context, we introduce four new classes of analytic univalent functions: ℑΨ,tb,α,ρ,ℑϑb,α,ρ,ℑΘ,mb,α,ρ$$ {\Im}_{\Psi, t}^{b,\alpha, \rho },\kern0.3em {\Im}_{\vartheta}^{b,\alpha, \rho },\kern0.3em
Arzu Akgül
wiley +1 more source
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes
Journal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley +1 more source
Local spectral estimates and quantitative weak mixing for substitution Z${\mathbb {Z}}$‐actions
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract The paper investigates Hölder and log‐Hölder regularity of spectral measures for weakly mixing substitutions and the related question of quantitative weak mixing. It is assumed that the substitution is primitive, aperiodic, and its substitution matrix is irreducible over the rationals.
Alexander I. Bufetov +2 more
wiley +1 more source
Extensions of Steiner Triple Systems
Journal of Combinatorial Designs, Volume 33, Issue 3, Page 94-108, March 2025.ABSTRACT In this article, we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop. We investigate extensions of Steiner loops, focusing in particular on the case of Schreier extensions, which provide a ...
Giovanni Falcone +2 more
wiley +1 more source
On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays
Journal of Combinatorial Designs, Volume 33, Issue 3, Page 109-122, March 2025.ABSTRACT In this article, we study the BM quasi‐Hermitian varieties, laying in the three‐dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in ...
Angela Aguglia +3 more
wiley +1 more source
Towards Nash‐Williams orientation conjecture for infinite graphs
Journal of Graph Theory, Volume 108, Issue 3, Page 608-619, March 2025.Abstract In 1960 Nash‐Williams proved that an edge‐connectivity of 2 k is sufficient for a finite graph to have a k
wiley +1 more source
A Review of Modern Multinomial‐Derived and Partition‐Based Record‐Linkage Methods
WIREs Computational Statistics, Volume 17, Issue 1, March 2025.ABSTRACT Fellegi and Sunter introduced in 1969 the first theory of record linkage. Their work was interpreted and applied in many situations. However, an infrastructure to support generalizing the theory was not available until 40 years later when Sadinle and Fienberg formally introduced partitioning in the record linkage arena.
Yves Thibaudeau
wiley +1 more source