Results 61 to 70 of about 56,755 (205)
Quantitative asymptotics for polynomial patterns in the primes
Mathematika, Volume 72, Issue 3, July 2026.Abstract We prove quantitative estimates for averages of the von Mangoldt and Möbius functions along polynomial progressions n+P1(m),…,n+Pk(m)$n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials Pi$P_i$. The error terms obtained save an arbitrary power of logarithm, matching the classical Siegel–Walfisz error term.
Lilian Matthiesen +2 more
wiley +1 more source
A Formal Account of Structuring Motor Actions With Sensory Prediction for a Naive Agent
Frontiers in Robotics and AI, 2020 For naive robots to become truly autonomous, they need a means of developing their perceptive capabilities instead of relying on hand crafted models.
Jean-Merwan Godon +2 more
doaj +1 more source
Sections and projections of the outer and inner regularizations of a convex body
Mathematika, Volume 72, Issue 3, July 2026.Abstract We establish new geometric inequalities comparing the volumes of sections and projections of a convex body, whose barycenter or Santaló point is at the origin, with those of its inner and outer regularizations. We also provide functional extensions of these inequalities to the setting of log‐concave functions. Our approach relies on the recent
Natalia Tziotziou
wiley +1 more source
Journal of Function SpacesAlgebraic curves and topological sequences play a crucial role in mathematics and graph theory, serving as a bridge between geometry, algebra, and number theory.
Mohammad Mazyad Hazzazi +4 more
doaj +1 more source
ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE
Forum of Mathematics, Sigma, 2016 For each integer $d\geqslant 3$ , we obtain a characterization of all graphs in which the ball of radius
ITAI BENJAMINI, DAVID ELLIS
doaj +1 more source
Canonical projection tilings defined by patterns
, 2018 We give a necessary and sufficient condition on a $d$-dimensional affine subspace of $\mathbb{R}^n$ to be characterized by a finite set of patterns which are forbidden to appear in its digitization.
Bédaride, Nicolas, Fernique, Thomas
core +1 more source
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
Some remarks on multiplicity codes
, 2014 Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core +1 more source
Which singular tangent bundles are isomorphic?
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract Logarithmic and b$ b$‐tangent bundles provide a versatile framework for addressing singularities in geometry. Introduced by Deligne and Melrose, these modified bundles resolve singularities by reframing singular vector fields as well‐behaved sections of these singular bundles.
Eva Miranda, Pablo Nicolás
wiley +1 more source
Max-algebra: the linear algebra of combinatorics?
Linear Algebra and its Applications, 2003 The paper deals with the relationship between basic max-algebraic problems and combinatorial or combinatorial optimization problems. By max-algebra the author understands the analogue of linear algebra developed for the pair of operations \((\oplus, \otimes)\) extended to matrices and vectors formally in the same way as in linear algebra.
openaire +2 more sources