Results 11 to 20 of about 7,714,647 (241)
On the number of decomposable trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A tree is called $k$-decomposable if it has a spanning forest whose components are all of size $k$. Analogously, a tree is called $T$-decomposable for a fixed tree $T$ if it has a spanning forest whose components are all isomorphic to $T$. In this paper,
Stephan G. Wagner
doaj +1 more source
Algorithms in algebraic number theory [PDF]
, 1992 In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and,
Lenstra Jr., Hendrik W.
core +5 more sources
Perturbed Keplerian Hamiltonian Systems
International Journal of Differential Equations, 2023 This paper deals with a class of perturbation planar Keplerian Hamiltonian systems, by exploiting the nondegeneracy properties of the circular solutions of the planar Keplerian Hamiltonian systems, and by applying the implicit function theorem, we show ...
Riadh Chteoui
doaj +1 more source
Buildings, 2023 An algebraic approach to the design of resource-efficient carbon-reinforced concrete structures is presented. Interdisciplinary research in the fields of mathematics and algebra on the one hand and civil engineering and concrete structures on the other ...
Sascha Stüttgen +5 more
doaj +1 more source
Impulse Propagation in Compositions and Words
International Journal of Mathematics and Mathematical Sciences, 2021 We consider compositions of n represented as bargraphs and subject these to repeated impulses which start from the left at the top level and destroy horizontally connected parts.
Margaret Archibald +4 more
doaj +1 more source
Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory [PDF]
, 2017 The goal of this present manuscript is to introduce the reader to the nonstandard method and to provide an overview of its most prominent applications in Ramsey theory and combinatorial number theory.Comment: 126 pages.
Di Nasso, Mauro +2 more
core +2 more sources
Position of the maximum in a sequence with geometric distribution [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 As a sequel to [arch04], the position of the maximum in a geometrically distributed sample is investigated. Samples of length n are considered, where the maximum is required to be in the first d positions.
Margaret Archibald
doaj +1 more source
The extended equivalence and equation solvability problems for groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and ...
Gabor Horvath, Csaba Szabo
doaj +1 more source
A nonstandard technique in combinatorial number theory [PDF]
, 2014 In [9], [15] it has been introduced a technique, based on nonstandard analysis, to study some problems in combinatorial number theory. In this paper we present three applications of this technique: the first one is a new proof of a known result regarding
Baglini, Lorenzo Luperi
core +1 more source
New family of special numbers associated with finite operator [PDF]
Mathematica Moravica, 2020 Using the notion of the generating function of a function, we define an operator with whom we manage to build a large family of numbers and polynomials. This technique permits to give the closed formulae and interesting combinatorial identities.
Goubi Mouloud
doaj +1 more source