Results 51 to 60 of about 1,223,570 (139)

Algebraic Capsets

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

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Bounded exponential sums with multiplicative coefficients

Mathematika, Volume 72, Issue 4, October 2026.
Abstract We investigate when the exponential sum Sf(x,α):=∑n⩽xf(n)e(nα)$S_f(x,\alpha) := \sum _{n\leqslant x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function f$f$ and α∈R$\alpha \in \mathbb {R}$. We show that under natural assumptions, Sf(x,α)$S_f(x,\alpha)$ is bounded only when f$f$ is very close to a twisted Dirichlet character χ(n ...
Péa Bazin, Ihor Pylaiev, Fred Tyrrell
wiley   +1 more source

Abelian number fields with frobenian conditions

Mathematika, Volume 72, Issue 4, October 2026.
Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley   +1 more source

EXAMINING HIGHER ORDER THINKING IN INDONESIAN LOWER SECONDARY MATHEMATICS CLASSROOMS [PDF]

, 2020
Indonesian students’ poor performance in the mathematics test of PISA 2015 prompted the decision by the Ministry of Education of Indonesia to pay more attention to the integration of higher-order thinking (HOT) in the curricula starting in 2018. This new
Doorman, L.M., Sub Mathematics Education, Doorman, Michiel, Mathematics Education, Tanudjaya, Citra Putriarum   +4 more
core   +2 more sources

Zeros of polynomials in derivatives of automorphic L$L$‐functions

Mathematika, Volume 72, Issue 4, October 2026.
Abstract Let Fm$\mathfrak {F}_m$ be the set of all cuspidal automorphic representations of GLm(AQ)$\mathrm{GL}_m(\mathbb {A}_{\mathbb {Q}})$, and let F(s,π)$F(s,\bm {\pi })$ be a polynomial in the derivatives of L$L$‐functions associated with representations π∈⋃m=1∞Fm$\pi \in \bigcup _{m=1}^{\infty } \mathfrak {F}_m$. We establish an asymptotic formula
Anji Dong, Nawapan Wattanawanichkul, Alexandru Zaharescu   +2 more
wiley   +1 more source

Bounded diameter monochromatic component covers

Mathematika, Volume 72, Issue 4, October 2026.
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley   +1 more source

Graphs of Linear Growth have Bounded Treewidth

, 2023
A graph class G has linear growth if, for each graph G ∈ G and every positive integer r, every subgraph of G with radius at most r contains O(r) vertices. In this paper, we show that every graph class with linear growth has bounded treewidth. Mathematics
David Wood, Robert Hickingbotham, J. Pascal Gollin, Bojan Mohar, Hickingbotham, Robert, Marc Distel, Kevin Hendrey, Daniel J. Harvey, Distel, Marc, Mohar, Bojan, Harvey, Daniel J., Wood, David R., Rutger Campbell   +12 more
core   +1 more source

How to pick your football team

Mathematika, Volume 72, Issue 4, October 2026.
Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley   +1 more source

An effective Bombieri–Vinogradov error term for sifting problems

Mathematika, Volume 72, Issue 4, October 2026.
Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed.
Daniel R. Johnston
wiley   +1 more source