Results 71 to 80 of about 3,886,089 (197)
HNN extensions and embedding theorems for groups
Abstract The Higman–Neumann–Neumann (HNN) paper of 1949 is a landmark of group theory in the 20th century. The proof of its main theorem covers less than a page and uses only pre‐existing technology, but the construction that it introduced, the HNN extension, quickly became one of the principal tools of combinatorial group theory, widely used to build ...
Martin R. Bridson +1 more
wiley +1 more source
Padovan and Perrin numbers of the form 7ᵗ-5ᶻ-3ʸ-2ˣ [PDF]
Consider the Padovan sequence (pₙ)ₙ≥₀ given by pₙ₊₃=pₙ₊₁+pₙ with p₀=p₁=p₂=1. Its companion sequence, the Perrin sequence (℘ₙ)ₙ≥₀, follows the same recursive formula as the Padovan numbers, but with different initial values: p₀=3, p₁=0 and p₂=2.
Djamel Bellaouar +2 more
doaj +1 more source
Semigroup ideals and linear diophantine equations
Let \(S\) be a finitely generated commutative cancellative monoid, and let \(\{n_1,\dots,n_r\}\subset S\) be a set of generators for \(S\). Let \(k\) be a field, \(R=k[S]\) the associated semigroup \(k\)-algebra, \(R=k[X_1,\dots,X_r]\) the polynomial ring, and \(\varphi\colon R\to k[S]\) the \(k\)-algebra homomorphism given by \(\varphi(X_i)=n_i\). The
openaire +2 more sources
Diophantine Equations and Linear Recurrences [PDF]
Ph.D. Thesis defense.
openaire +1 more source
Random Diophantine equations in the primes II
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley +1 more source
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
Discovery of Exact Equations for Integer Sequences
Equation discovery, also known as symbolic regression, is the field of machine learning that studies algorithms for discovering quantitative laws, expressed as closed-form equations or formulas, in collections of observed data.
Boštjan Gec +2 more
doaj +1 more source
Solving the n $n$‐Player Tullock Contest
ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley +1 more source
On Linear Diophantine Equations and Fibonacci Numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Real-world applications of number theory [PDF]
The above abstract has been extracted by the translator from the original article (J. Klaška, Real-world applications of number theory, South Bohemia Mathematical Letters, 25 no.
Rahim Rahmati-Asghar
doaj +1 more source

