Results 71 to 80 of about 147,491 (227)
Markov's conjecture on integral necklaces
Bulletin of the London Mathematical Society, EarlyView.Abstract We use the geometric reformulation of Markov's uniqueness conjecture in terms of the simple length spectrum of the modular torus to rewrite the conjecture in combinatorial terms by explicitly describing this set of lengths.
David Fisac
wiley +1 more source
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
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
The combinatorics of splittability
, 2004 Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete classification of
Bartoszyński +13 more
core +3 more sources
On stabilizers in finite permutation groups
Bulletin of the London Mathematical Society, EarlyView.Abstract Let G$G$ be a permutation group on the finite set Ω$\Omega$. We prove various results about partitions of Ω$\Omega$ whose stabilizers have good properties. In particular, in every solvable permutation group there is a set‐stabilizer whose orbits have length at most 6, which is best possible and answers two questions of Babai.
Luca Sabatini
wiley +1 more source
Trace Identities for the Topological Vertex
, 2017 The topological vertex is a universal series which can be regarded as an object in combinatorics, representation theory, geometry, or physics. It encodes the combinatorics of 3D partitions, the action of vertex operators on Fock space, the Donaldson ...
Bryan, Jim +2 more
core +1 more source
Curves of best approximation on wonderful varieties
Bulletin of the London Mathematical Society, EarlyView.Abstract We give an unconditional proof of the Coba conjecture for wonderful compactifications of adjoint type for semisimple Lie groups of type An$A_n$. We also give a proof of a slightly weaker conjecture for wonderful compactifications of adjoint type for arbitrary Lie groups.
Christopher Manon +2 more
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
The Combinatorics of Iterated Loop Spaces
, 2003 It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads.
Batanin, M. A.
core +1 more source
Plank theorems and their applications: A survey
Bulletin of the London Mathematical Society, EarlyView.Abstract Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems in various areas of mathematics.
William Verreault
wiley +1 more source