Results 31 to 40 of about 1,701 (164)

A Covering pursuit game

open access: yesMathematika, Volume 72, Issue 1, January 2026.
Abstract In the “Covering” pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim of the cops is to ensure that, after every one of their turns, there is a cop at the same vertex as the ...
Benjamin Gillott
wiley   +1 more source

Combinatorics on number walls and the P(t)$P(t)$‐adic Littlewood conjecture

open access: yesMathematika, Volume 72, Issue 1, January 2026.
Abstract In 2004, de Mathan and Teulié stated the p$p$‐adic Littlewood conjecture (p$p$‐LC) in analogy with the classical Littlewood conjecture. Let Fq$\mathbb {F}_q$ be a finite field P(t)$P(t)$ be an irreducible polynomial with coefficients in Fq$\mathbb {F}_q$. This paper deals with the analogue of p$p$‐LC over the ring of formal Laurent series over
Steven Robertson
wiley   +1 more source

The modular automorphisms of quotient modular curves

open access: yesMathematika, Volume 72, Issue 1, January 2026.
Abstract We obtain the modular automorphism group of any quotient modular curve of level N$N$, with 4,9∤N$4,9\nmid N$. In particular, we obtain some unexpected automorphisms of order 3 that appear for the quotient modular curves when the Atkin–Lehner involution w25$w_{25}$ belongs to the quotient modular group. We also prove that such automorphisms are
Francesc Bars, Tarun Dalal
wiley   +1 more source

New upper bound for lattice covering by spheres

open access: yesMathematika, Volume 72, Issue 1, January 2026.
Abstract We show that there exists a lattice covering of Rn$\mathbb {R}^n$ by Euclidean spheres of equal radius with density O(nlnβn)$O\big (n \ln ^{\beta } n \big)$ as n→∞$n\rightarrow \infty$, where β≔12log28πe33=1.85837….$$\begin{align*} \beta \coloneqq \frac{1}{2} \log _2 {\left(\frac{8 \pi \mathrm{e}}{3\sqrt 3}\right)}=1.85837\,\ldots . \end{align*
Jun Gao   +3 more
wiley   +1 more source

One‐level densities in families of Grössencharakters associated to CM elliptic curves

open access: yesMathematika, Volume 72, Issue 1, January 2026.
Abstract We study the low‐lying zeros of a family of L$L$‐functions attached to the complex multiplication elliptic curve Ed:y2=x3−dx$E_d \;:\; y^2 = x^3 - dx$, for each odd and square‐free integer d$d$. Specifically, upon writing the L$L$‐function of Ed$E_d$ as L(s−12,ξd)$L(s-\frac{1}{2}, \xi _d)$ for the appropriate Grössencharakter ξd$\xi _d$ of ...
Chantal David, Lucile Devin, Ezra Waxman
wiley   +1 more source

Completing Partial k‐Star Designs

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 12, Page 446-455, December 2025.
ABSTRACT A k‐star is a complete bipartite graph K 1 , k. A partial k‐star design of order n is a pair ( V , A ) where V is a set of n vertices and A is a set of edge‐disjoint k‐stars whose vertex sets are subsets of V. If each edge of the complete graph with vertex set V is in some star in A, then ( V , A ) is a (complete) k‐star design.
Ajani De Vas Gunasekara, Daniel Horsley
wiley   +1 more source

Maximum Shattering

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.
ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon   +2 more
wiley   +1 more source

Dominating K t‐Models

open access: yesJournal of Graph Theory, Volume 110, Issue 4, Page 448-456, December 2025.
ABSTRACT A dominating K t‐model in a graph G is a sequence ( T 1 , … , T t ) of pairwise disjoint non‐empty connected subgraphs of G, such that for 1 ⩽ i < j ⩽ t every vertex in T j has a neighbour in T i. Replacing ‘every vertex in T j’ by ‘some vertex in T j’ retrieves the standard definition of K t‐model, which is equivalent to K t being a minor of ...
Freddie Illingworth, David R. Wood
wiley   +1 more source

PD‐1‐Cis IL‐2R Agonism Determines the Predicted Pharmacological Dose Range for the Immunocytokine Eciskafusp Alfa (PD1‐IL2v)

open access: yesCPT: Pharmacometrics &Systems Pharmacology, Volume 14, Issue 12, Page 2128-2138, December 2025.
ABSTRACT Binding in cis‐configuration to the PD‐1 receptor (PD‐1) and IL‐2βγ receptor (IL‐2Rβγ) has been shown to lead to differentiation of CD8 T cells to better effectors, which is anticipated to drive efficacy of the immune‐targeted cytokine eciskafusp alfa, or PD1‐IL2v.
Lucy G. Hutchinson   +6 more
wiley   +1 more source

Fast Construction on a Restricted Budget

open access: yesRandom Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT We introduce a model of a controlled random graph process. In this model, the edges of the complete graph Kn$$ {K}_n $$ are ordered randomly and then revealed, one by one, to a player called Builder. He must decide, immediately and irrevocably, whether to purchase each observed edge.
Alan Frieze   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy