Results 121 to 130 of about 235,748 (327)
Continuous dependence and differentiation of solutions of finite difference equations
International 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
A structural approach to subset-sum problems [PDF]
arXiv, 2008 We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various areas, such as number theory, combinatorics and mathematical physics.
arxiv
Historia Mathematica, 1979 AbstractCombinatorics has been rather neglected by historians of mathematics. Yet there are good reasons for studying the origins of the subject, since it is a kind of mathematical subculture, not exactly parallel in its development with the great disciplines of arithmetic, algebra, and geometry.
openaire +2 more sources
Discrete Mathematics, 2006 AbstractInspired by Claude Berge's interest in and writings on Hex, we discuss some results on the game.
Jack van Rijswijck, Ryan B. Hayward
openaire +2 more sources
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
The Hilton–Milnor theorem in higher topoi
Bulletin of the London Mathematical Society, EarlyView.Abstract In this note, we show that the classical theorem of Hilton–Milnor on finite wedges of suspension spaces remains valid in an arbitrary ∞$\infty$‐topos. Our result relies on a version of James' splitting proved in [Devalapurkar and Haine, Doc. Math.
Samuel Lavenir
wiley +1 more source
On the isomorphism problem for monoids of product‐one sequences
Bulletin of the London Mathematical Society, EarlyView.Abstract Let G1$G_1$ and G2$G_2$ be torsion groups. We prove that the monoids of product‐one sequences over G1$G_1$ and over G2$G_2$ are isomorphic if and only if the groups G1$G_1$ and G2$G_2$ are isomorphic. This was known before for abelian groups.
Alfred Geroldinger, Jun Seok Oh
wiley +1 more source
On Lev's periodicity conjecture
Bulletin of the London Mathematical Society, EarlyView.Abstract We classify the sum‐free subsets of F3n${\mathbb {F}}_3^n$ whose density exceeds 16$\frac{1}{6}$. This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum‐free subset A⊆F3n${A\subseteq {\mathbb {F}}_3^n}$ is maximal with respect to inclusion and aperiodic (in the sense that there is no non‐zero vector v$v$
Christian Reiher
wiley +1 more source
On an Erdős similarity problem in the large
Bulletin of the London Mathematical Society, EarlyView.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
Additive Combinatorics and its Applications in Theoretical Computer Science
Theory 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