Results 151 to 160 of about 46,626 (239)
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2011 Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
Maximum Induced Trees and Forests of Bounded Degree in Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova +2 more
wiley +1 more source
Combinatorics, Words and Symbolic Dynamics
, 2016 Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important concepts, providing a clear exposition of some recent results, and emphasise ...
core
Random Diophantine equations in the primes
Mathematika, Volume 72, Issue 3, July 2026.Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley +1 more source
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
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 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
On the Lang–Trotter conjecture for Siegel modular forms
Mathematika, Volume 72, Issue 3, July 2026.Abstract Let f$f$ be a genus‐two cuspidal Siegel eigenform. We prove an adelic open image theorem for the compatible system of Galois representations associated with f$f$, generalizing the results of Ribet and Momose for elliptic modular forms. Using this result, we investigate the distribution of the Hecke eigenvalues ap$a_p$ of f$f$, and obtain upper
Arvind Kumar, Moni Kumari, Ariel Weiss
wiley +1 more source
Gluing posets and the dichotomy of poset saturation numbers
Mathematika, Volume 72, Issue 3, July 2026.Abstract Given a finite poset P$\mathcal {P}$, we say that a family F$\mathcal {F}$ of subsets of [n]$[n]$ is P$\mathcal {P}$‐saturated if F$\mathcal {F}$ does not contain an induced copy of P$\mathcal {P}$, but adding any other set to F$\mathcal {F}$ creates an induced copy of P$\mathcal {P}$.
Maria‐Romina Ivan, Sean Jaffe
wiley +1 more source