Results 81 to 90 of about 580,253 (234)

Double‐jump phase transition for the reverse Littlewood–Offord problem

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Erdős conjectured in 1945 that for any unit vectors v1,…,vn$v_1, \ldots, v_n$ in R2$\mathbb {R}^2$ and signs ε1,…,εn$\varepsilon _1, \ldots, \varepsilon _n$ taken independently and uniformly in {−1,1}$\lbrace -1,1\rbrace$, the random Rademacher sum σ=ε1v1+⋯+εnvn$\sigma = \varepsilon _1 v_1 + \cdots + \varepsilon _n v_n$ satisfies ∥σ∥2⩽1$\Vert \
Lawrence Hollom, Julien Portier, Victor Souza   +2 more
wiley   +1 more source

Observability of string vibrations

Electronic Journal of Qualitative Theory of Differential Equations, 2014
Transversal vibrations $u=u(x,t)$ of a string of length $l$ under three essential boundary conditions are studied, where $u$ is governed by the Klein--Gordon equation: $$u_{tt}(x,t) = a^2u_{xx}(x,t) - cu(x,t), (x,t) \in [0,l]\times \mathbb{R}; \ 0 < a ...
András Szijártó, Jenő Hegedűs
doaj   +1 more source

Random Diophantine equations in the primes II

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
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

Diophantine equation $\frac{q^n-1}{q-1}=y$ for four prime divisors of $y-1$ [PDF]

, 2005
summary:In this paper the special diophantine equation $\frac{q^{n}-1}{q-1}=y$ with integer coefficients is discussed and integer solutions are sought. This equation is solved completely just for four prime divisors of $y-1$
Polický, Zdeněk
core  

Tessellation Groups, Harmonic Analysis on Non‐Compact Symmetric Spaces and the Heat Kernel in View of Cartan Convolutional Neural networks

Fortschritte der Physik, Volume 74, Issue 4, April 2026.
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é, Federico Milanesio, Marcelo Oyarzo, Matteo Santoro, Mario Trigiante   +4 more
wiley   +1 more source

The linear diophantine equation ax+by+cz=e IN Q(root 5) [PDF]

, 1996
The solution of the linear diophantine equation a(0)x + a(1)y + a(2)y =
Altindis, Hüseyin, Atasoy, Muzaffer
core  

Discovery of Exact Equations for Integer Sequences

Mathematics
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, Sašo Džeroski, Ljupčo Todorovski   +2 more
doaj   +1 more source

Semigroup ideals and linear diophantine equations

Linear Algebra and its Applications, 1999
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

Solving the n $n$‐Player Tullock Contest

Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.
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

Finding the General Solution of a Linear Diophantine Equation [PDF]

, 1977
A new procedure for finding the general solution of a linear diophantine equation is given. As a byproduct, the algorithm finds the greatest common divisor (gcd) of a set of integers.
Morito, Susumu, Salkin, Harvey M.
core   +1 more source