Results 71 to 80 of about 28,564 (220)

Continuous dependence and differentiation of solutions of finite difference equations

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1991
Conditions are given for the continuity and differentiability of solutions of initial value problems and boundary value problems for the nth order finite difference equation, u(m+n)=f(m,u(m),u(m+1),…,u(m+n−1)),m∈ℤ.
Johnny Henderson, Linda Lee
doaj   +1 more source

Subsquares in Random Latin Squares and Rectangles

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 4, Page 184-197, April 2026.
ABSTRACT A k × n partial Latin rectangle is C ‐ sparse if the number of nonempty entries in each row and column is at most C and each symbol is used at most C times. We prove that the probability a uniformly random k × n Latin rectangle, where k < ( 1 ∕ 2 − α ) n, contains a β n‐sparse partial Latin rectangle with ℓ nonempty entries is 1 ± ε n ℓ for ...
Alexander Divoux   +3 more
wiley   +1 more source

Some bounds related to the 2‐adic Littlewood conjecture

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley   +1 more source

Graphs with 4-Rainbow Index 3 and n − 1

open access: yesDiscussiones 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

Additive Combinatorics and its Applications in Theoretical Computer Science

open access: yesTheory of Computing, 2017
Additive combinatorics (or perhaps more accurately, arithmetic combinatorics) is a branch of mathematics which lies at the intersection of combinatorics, number theory, Fourier analysis and ergodic theory.
Shachar Lovett
semanticscholar   +1 more source

Non‐vanishing of Poincaré series on average

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract We study when Poincaré series for congruence subgroups do not vanish identically. We show that almost all Poincaré series with suitable parameters do not vanish when either the weight k$k$ or the index m$m$ varies in a dyadic interval. Crucially, analyzing the problem ‘on average’ over these weights or indices allows us to prove non‐vanishing ...
Ned Carmichael, Noam Kimmel
wiley   +1 more source

Discrepancy of arithmetic progressions in boxes and convex bodies

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley   +1 more source

The analysis of the RBL-STEM application in improving student financial literacy in controlling consumptive behavior

open access: yesHeliyon
This 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

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley   +1 more source

A focal boundary value problem for difference equations

open access: yesInternational 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

Home - About - Disclaimer - Privacy