Results 71 to 80 of about 6,526 (216)
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
Graphs with 4-Rainbow Index 3 and n − 1
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang +3 more
doaj +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
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 +2 more
wiley +1 more source
HeliyonThis study aims to analyze the application of the RBL-STEM learning model in improving students' financial literacy to control their consumptive behavior.
Sumarno +5 more
doaj +1 more source
A focal boundary value problem for difference equations
International Journal of Mathematics and Mathematical Sciences, 1993 The eigenvalue problem in difference equations, (−1)n−kΔny(t)=λ∑i=0k−1pi(t)Δiy(t), with Δty(0)=0, 0≤i≤k, Δk+iy(T+1)=0, 0 ...
Cathryn Denny, Darrel Hankerson
doaj +1 more source
Combinatorics and connectionism
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Discussiones Mathematicae Graph Theory, 2019 The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let Pk denote the path on k vertices and let mPk denote m disjoint copies of Pk.
Lan Yongxin, Qin Zhongmei, Shi Yongtang
doaj +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, Volume 34, Issue 9, Page 437-456, September 2026.ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source