Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 24 February

Combinatorics

Corrections to classical results on Independence and Covering numbers of the Splitting graph

The splitting graph $S(G)$ of a finite simple graph $G$ was introduced by Sampathkumar and Walikar in 1980~\cite{SW1980} and has been extensively studied in relation to graph invariants of $G$. In their original work, several formulas relating the independence number and the vertex cover number of $S(G)$ to the corresponding parameters of $G$ were stated and subsequently cited in the literature. In this paper, we show that some of these classical equalities do not hold in general. We present explicit counterexamples disproving the published results concerning independence and vertex cover numbers of splitting graphs. Moreover, we establish the correct formulas and precisely characterize the cases in which the original statements are valid and those in which they fail. These results correct an error that has remained unnoticed for more than four decades and provide a clearer understanding of splitting graphs from the perspective of independence and vertex cover number.
Read the full abstract

Differential Geometry

Families of projective bundles that admit coupled Kähler-Einstein metrics but no Kähler-Einstein metrics

We construct two families of projective bundles that admit two-coupled Kähler-Einstein (cKE) metrics but do not ordinary Kähler-Einstein metrics in sufficiently high dimensions. We also prove that no such examples arise among toric Fano threefolds, for any decomposition of $c_1(X)$, when considering the natural projection onto $\mathbb P^1$.
Read the full abstract

Algebraic Geometry

A Super Version of a Theorem of Fricke-Klein

We start studying the character variety of the algebraic supergroup OSp(1|2) from the algebraic perspective. We do this by first investigating the specific case of the character variety of the free group on two letters and try to describe the ring of invariants with respect to the conjugation action. The explicit description of the corresponding character variety for SL(2) was done by Fricke and Klein, so this can be seen as a variant of this theorem for its supergeometric counterpart OSp(1|2) and briefly touch upon the character stack for OSp(1|2)
Read the full abstract

Number Theory

Single conjugacy classes of isometries in orthogonal groups over local fields

All isometries $\sigma$ in a quadratic space over a non-archimedean local field of characteristic not 2 satisfying that any isometry $\tau$ which is conjugate to $\sigma$ in the general linear group is conjugate to $\sigma$ in the orthogonal group are determined. This extends \cite[Theorem 2.1]{Mil} to arbitary cases.
Read the full abstract

Analysis of PDEs

Global Existence for Reaction-diffusion Equations with State-Dependent Delay and Fast-growing Nonlinearities

This work aims to study the initial-boundary value problem of the reaction-diffusion equation with state-dependent delay $\pa_{t}u-\Delta u=f(u)+g(u,u(t-\tau(t,u_t)))+h(t,x)$ in a bounded domain. We establish the global existence of the problem under suitable dissipative-type structural conditions, allowing both nonlinear terms $f$ and $g$ to have arbitrary polynomial growth rates. Another highlight in this work is that, we significantly relax the continuity assumptions imposed on the delay functions.
Read the full abstract

Probability

Numerical ranges of non-normal random matrices: elliptic Ginibre and non-Hermitian Wishart ensembles

The numerical range of a non-normal matrix plays a central role as a descriptor of non-normal effects beyond spectral information. We study a class of fundamental non-Hermitian random matrix ensembles that interpolate between the Hermitian and non-Hermitian regimes. Our analysis focuses on the elliptic Ginibre ensemble and its chiral counterpart, as well as on non-Hermitian Wishart matrices. For each of these models, we explicitly characterise the geometry of the numerical range in the large-system limit. In particular, we show that for the elliptic Ginibre ensemble and its chiral version, the limiting numerical range is an ellipse, whereas for the non-Hermitian Wishart ensemble it is described by a non-elliptic envelope. Furthermore, we determine the numerical range of products of $n$ independent elliptic Ginibre matrices, which recovers, in the cases $n=1$ and $n=2$, the results for the elliptic Ginibre ensemble and the non-Hermitian Wishart ensemble at maximal non-Hermiticity, respectively.
Read the full abstract

Classical Analysis and ODEs

Sharp isoperimetric inequalities on the Hamming cube II: The critical exponent

A sharp isoperimetric inequality for the Hamming cube is proved at the critical exponent $\beta=\frac12$. This follows up on previous work, where such bounds were established for $\beta$ near $\frac12$. As a consequence, this result settles a conjecture of Kahn and Park on cube partitions and yields a sharp $L^1$ Poincaré inequality for Boolean-valued functions. It also confirms a low-noise limit for balanced functions predicted by the Hellinger conjecture on noisy Boolean channels in information theory.
Read the full abstract

All authors Polona Durcik, Paata Ivanisvili, Joris Roos, Xinyuan Xie

Information Theory

Permutation decoding of algebraic geometry codes from Hermitian and norm-trace curves

Permutation decoding is a process that utilizes the permutation automorphism group of a linear code to correct errors in received words. Given a received word, a set of automorphisms, called a PD set, moves errors out of the information positions so that the original message can be determined. In this paper, we investigate permutation decoding for certain families of algebraic geometry codes. Automorphisms of the underlying curve are used to specify permutation automorphisms of the code. Specifically, we describe permutation decoding sets that correct specific burst errors for one-point codes on Hermitian and norm-trace curves.
Read the full abstract

All authors Monica Lichtenwalner, Hiram H. López, Gretchen L. Matthews, Padmapani Seneviratne

Geometric Topology

Equivalent genus-2 factorizations of type (4, 3)

The genus-2 fibrations of type (4, 3) found by Baykur-Korkmaz, Hamada, and Xiao are supported on the same total space. In this short note, we show that the Lefschetz fibration structures are the same.

Geometric Topology

An algorithm for Seifert surfaces in 3-manifolds via surgery presentations

The classical Seifert algorithm provides an explicit construction of a Seifert surface for any link in $S^3$. Alegria and Menasco extended this construction to integral homology $3$-spheres using Heegaard splittings. In this paper, we extend the Seifert algorithm to null-homologous links in arbitrary $3$-manifolds via surgery on framed links in $S^3$.
Read the full abstract

Probability

High local maxima of stationary smooth Gaussian fields

Consider the point process (in $\mathbb{R}^d$) of local maxima of smooth Gaussian fields, with sufficient decay of correlation at infinity, above a level $u$. We show that this point process, rescaled appropriately, converges weakly to a Poisson point process in the limit $u \to \infty$. Our proof relies on the classical observation that simple point processes are characterised by avoidance probabilities (i.e. $\mathbb{P}(\eta(B)=0)$ for a point process $\eta$ and Borel set $B$). Then we approximate avoidance probability with the excursion probability, where the latter is well studied. Second main result is a quantified version of the Poisson convergence of high local maxima of the Bargmann-Fock field in $\mathbb{R}^2$. We prove that, for Bargmann-Fock field in two dimensions, the total variation distance between a Poisson random variable and the number of local maxima of the field above a threshold $u$ in an $R \times R$ box in $\mathbb{R}^2$ decays like $\exp(- \beta u^2)$, for some fixed $\beta >0$. As an immediate consequence, when the level $u$ is a function of $R$ such that $u(R) \to \infty$ and $u(R)/ \sqrt{\log R} \to 0$ as $R \to \infty$, we have a quantitative central limit theorem for the number of high local maxima. The proof is based on the Chen-Stein method for quantitative Poisson approximation. We produce a close coupling of a stationary smooth field and its Palm version, which might be of independent interest.
Read the full abstract

Monday 23 February

Optimization and Control

Mean-Field Path-Integral Diffusion: From Samples to Interacting Agents

Independent sample generation is the prevailing paradigm in modern diffusion-based generative models of AI. We ask a different question: can samples coordinate through shared population statistics to transport probability mass more efficiently? We introduce Mean-Field Path-Integral Diffusion (MF-PID), a framework in which samples are promoted to interacting agents whose drift depends self-consistently on the evolving population density. The coupling converts distribution matching into a McKean–Vlasov extension of the stochastic optimal transport problem, unifying generative modeling and multi-agent control under the same Hamilton–Jacobi–Bellman/Kolmogorov–Fokker–Planck duality. We identify two analytically tractable regimes: a Linear–Quadratic–Gaussian (LQG) benchmark in which the infinite-dimensional mean-field system reduces to a finite set of Riccati and linear ODEs, and a Gaussian-mixture regime governed by a piecewise-constant protocol that preserves closed-form solvability. For a quadratic interaction potential with schedule $\beta_t$ and zero base drift we prove that the self-consistent MF guidance is the exact linear interpolant between initial and target global means – a result that holds for arbitrary initial and target densities and any $\beta_t$. Applied to demand-response control of energy systems, where agents aggregated into an ensemble are energy consumers (e.g.\ thermal zones within a building), MF-PID achieves 19–24% reductions in cumulative control energy over independent-agent baselines while matching the prescribed terminal distribution exactly, and reveals how coordination redistributes actuation effort across heterogeneous sub-populations.
Read the full abstract

Dynamical Systems · Cross-listed from cs.MA

Agentic Hives: Equilibrium, Indeterminacy, and Endogenous Cycles in Self-Organizing Multi-Agent Systems

Current multi-agent AI systems operate with a fixed number of agents whose roles are specified at design time. No formal theory governs when agents should be created, destroyed, or re-specialized at runtime-let alone how the population structure responds to changes in resources or objectives. We introduce the Agentic Hive, a framework in which a variable population of autonomous micro-agents-each equipped with a sandboxed execution environment and access to a language model-undergoes demographic dynamics: birth, duplication, specialization, and death. Agent families play the role of production sectors, compute and memory play the role of factors of production, and an orchestrator plays the dual role of Walrasian auctioneer and Global Workspace. Drawing on the multi-sector growth theory developed for dynamic general equilibrium (Benhabib & Nishimura, 1985; Venditti, 2005; Garnier, Nishimura & Venditti, 2013), we prove seven analytical results: (i) existence of a Hive Equilibrium via Brouwer's fixed-point theorem; (ii) Pareto optimality of the equilibrium allocation; (iii) multiplicity of equilibria under strategic complementarities between agent families; (iv)-(v) Stolper-Samuelson and Rybczynski analogs that predict how the Hive restructures in response to preference and resource shocks; (vi) Hopf bifurcation generating endogenous demographic cycles; and (vii) a sufficient condition for local asymptotic stability. The resulting regime diagram partitions the parameter space into regions of unique equilibrium, indeterminacy, endogenous cycles, and instability. Together with the comparative-statics matrices, it provides a formal governance toolkit that enables operators to predict and steer the demographic evolution of self-organizing multi-agent systems.
Read the full abstract

Optimization and Control

KKT conditions for optimization with generalized invex fuzzy functions

This paper explores optimality conditions in optimization problems involving generalized invex fuzzy functions. We extend the classical KKT framework to settings in which the objective and constraint functions are nonsmooth, vector-valued, and fuzzy-valued, and satisfy various generalized invexity conditions such as V-invexity, V-pseudoinvexity, and Vquasiinvexity. After reviewing key concepts from nonsmooth analysis and multiobjective optimization, we derive new KKT-type conditions under weaker assumptions than classical convexity, ensuring (weak) Pareto optimality in fuzzy environments. Our results unify and generalize earlier work by Antczak and Mishra as well as demonstrate the power of generalized invexity in establishing optimality without requiring differentiability nor convexity. Several illustrative examples are included to demonstrate the applicability of the developed theory.
Read the full abstract

General Mathematics

Fermatean fuzzy type entropy-based new integrated decision making method with analysis of energy poverty in Türkiye application

Income-based poverty indicators are insufficient to fully explain the multifaceted socio-economic issue of energy poverty. The ability of households to obtain and use energy services sustainably is significantly influenced by structural factors like building efficiency, energy prices, climate, and regional disparities. Moreover, the assessment of energy poverty inherently involves uncertainty, vagueness, and subjective judgments, which limit the applicability of classical deterministic evaluation approaches. This paper proposes a novel, integrated MCDM framework based on FFSs to address these issues. To objectively assess the uncertainty present in FF-information, a novel FF-entropy metric is first presented. The proposed entropy employs a nonlinear structure, enabling a more flexible and sensitive representation of fuzziness in complex decision environments. The subjective weights obtained from the FF-PIPRECIA approach are then blended with the entropy-based objective weights. Lastly, options are ranked according to their relative usefulness in relation to ideal and anti-ideal solutions using the FF-MARCOS approach. The proposed framework is applied to the regional evaluation of energy poverty in Turkiye, considering seven geographical regions and six key criteria: income level, energy prices, energy efficiency, building efficiency, climate, and urbanization. Sensitivity analysis, weight perturbation analysis, and entropy-criterion dominance analysis validate the robustness and stability of the suggested model across various parameter settings. For policymakers and practitioners seeking to develop focused, effective, and socially just energy policies amid uncertainty, the proposed method provides a robust, adaptable decision-support tool.
Read the full abstract

Differential Geometry

The Cone of J-Hermitian Matrices and a Geometric Mean

We study the cone $\mathscr{P}_{\text{J}}$ of positive J-Hermitian matrices associated with an indefinite signature matrix J = $\text{Id}_{p,q}$. We show that the J-exponential map is bijective and use it to analyze the algebraic and geometric structure of $\mathscr{P}_{\text{J}}$. Through a canonical identification with the cone of positive definite matrices, we endow $\mathscr{P}_{\text{J}}$ with a natural Riemannian structure. In this setting, we define a J-geometric mean as the midpoint of geodesics and prove that it is uniquely characterized as the solution of a Riccati-type equation.
Read the full abstract

Optimization and Control · Cross-listed from cs.GT

A General Equilibrium Theory of Orchestrated AI Agent Systems

We establish a general equilibrium theory for systems of large language model (LLM) agents operating under centralized orchestration. The framework is a production economy in the sense of Arrow-Debreu (1954), extended to infinite-dimensional commodity spaces following Bewley (1972). Each LLM agent is modeled as a firm whose production set Y a $\subset$ H = L 2 ([0, T ], R R ) represents the feasible metric trajectories determined by its frozen model weights. The orchestrator is the consumer, choosing a routing policy over the agent DAG to maximize system welfare subject to a budget constraint evaluated at functional prices p $\in$ H A . These prices-elements of the Hilbert dual of the commodity space-assign a shadow value to each metric of each agent at each instant. We prove, via Brouwer's theorem applied to a finitedimensional approximation V K $\subset$ H, that every such economy admits at least one general equilibrium (p * , y * , $\pi$ * ). A functional Walras' law holds as a theorem: the value of functional excess demand is zero for all prices, as a consequence of the consumer's budget constraint-not by construction. We further establish Pareto optimality (First Welfare Theorem), decentralizability of Pareto optima (Second Welfare Theorem), and uniqueness with geometric convergence under a contraction condition (Banach). The orchestration dynamics constitute a Walrasian tâtonnement that converges globally under the contraction condition, unlike classical tâtonnement (Scarf, 1960). The framework admits a DSGE interpretation with SLO parameters as policy rates.
Read the full abstract

Mathematical Physics

Lorentz-boosted diffusion: initial value formulation and exact solutions

It is well known that the diffusion equation, when treated as a stand-alone partial differential equation, exhibits exponential instabilities in boosted frames, which render the corresponding initial-value problem ill-posed. Recently, however, it was shown that Fick-type diffusion arises as the exact hydrodynamic sector of relativistic Fokker-Planck kinetic theory. In this work, we exploit this kinetic embedding to formulate a modified initial-value problem for one-dimensional Lorentz-boosted diffusion. We show that the resulting dynamics are well posed both forward and backward in time, provided the boosted density profiles admit a kinetic-theory realization. Such profiles form a space of band-limited functions, within which the evolution can be expressed as a discrete superposition of spatially sampled initial data, weighted by a Shannon-Whittaker-type Green function defined on the full Minkowski plane. The Green function is obtained in closed analytic form.
Read the full abstract

Combinatorics

Incomplete Open Platonic Solids

Sol LeWitt famously enumerated all the incomplete open cubes, finding 122 of these connected, non-planar subsets of the edges of the cube. Since then, while several projects have revisited the cube enumeration, no such enumeration has been published for any other interesting solid. In this paper we present work on enumerating all the incomplete open platonic solids, finding 6 tetrahedra, 122 cubes (just like LeWitt), 185 octahedra, 2\,423\,206 dodecahedra and 16\,096\,166 icosahedra.
Read the full abstract

Probability

Independence of the indicator functions of record values for Multivariate independent data

We consider a sequence of random vectors on \(\mathbb{R}^d, \ d\geq 1\). We consider the record values based on the simultaneous strict inequality of the coordinates. The indicator record variable (irv) of the j-th observation is the function that assigns the value 1 (one) if that observation is a record value and the null value otherwise. Here, we give a detailed and a thorough proof that the indicator functions are independent, whenever the data are themselves independent, not necessarily <i>iid</i>, in \(\mathbb{R}^d, \ d\geq 1\). We compare that proof with available proofs in dimension one. Indeed, in seminal works on records, in particular in Ahsanullah(2024), Nevzorov(2001), Resnick (1987), Ahsanullah and Nevzorov (2015), etc., the independence of record indicator functions is usually validated based on logical reasoning, and so, is not rigorously proved. This allows us to undertake a detailed and thorough proof for independent data, not necessity <i>iid</i>, in \(\mathbb{R}^d, \ d\geq 1\). The proof includes leads for not even independent data.
Read the full abstract

Differential Geometry

Morita equivalence of Nijenhuis structures

We introduce Morita equivalence for Nijenhuis groupoids and for their infinitesimal counterparts, establishing a global-to-infinitesimal correspondence under the Lie functor. A special case is that of holomorphic Lie groupoids and algebroids. We use our framework to enhance the known Morita equivalences for quasi-symplectic groupoids and Dirac structures with compatible Nijenhuis structures. Finally, subject to certain conditions, we prove that the modular class of Poisson-Nijenhuis manifolds is invariant under Morita equivalence.
Read the full abstract

Dynamical Systems

KANDy: Kolmogorov-Arnold Networks and Dynamical System Discovery

We introduce the Kolmogorov-Arnold Network for Dynamics (KANDy) as a zero-depth, wide neural architecture capable of discovering governing equations in chaotic and complex dynamical systems. Building on the foundation of Kolmogorov-Arnold Networks (KANs), KANDy explicitly learns governing equations by replacing sparse regression with a KAN. The synthesis of KANs and sparse regression addresses the limitations of equation discovery for KANs applied to dynamical systems and overcomes cases where sparse regression is hindered by sparsity constraints. Additionally, we show that our model, applied to the Hopf Fibration, recovers topological structure, thereby improving coherence with attractor properties. We apply our model to discrete and continuous dynamical systems, as well as to chaotic partial differential equations (PDEs). These results position KANDy as an interpretable and effective alternative for data-driven modeling of nonlinear dynamical systems.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Wasserstein Distributionally Robust Online Learning

We study online Wasserstein distributionally robust optimization (DRO), where the ambiguity set is a Wasserstein ball centered at the empirical distribution and evolves with each observation. We formulate each round as a zero-sum game and develop an online distributional best-response algorithm that requires only one projected subgradient step per iteration. Combining regret analysis with measure concentration, we establish explicit, instance-dependent, and high-probability convergence rates to the optimal offline DRO value.
Read the full abstract

Optimization and Control · Cross-listed from cs.GT

Competition Versus Complexity in Multiple-Selection Prophet Inequalities

Competition complexity formalizes a compelling intuition: rather than refining the mechanism, how much additional competition is sufficient for a simple mechanism to compete with an optimal one? We begin the study of this question in multi-unit pricing for welfare maximization using prophet inequalities. An online decision-maker observes $m \geq k$ nonnegative values drawn independently from a known distribution, may select up to $k$ of them, and aims to maximize the expected sum of selected values. The benchmark is a prophet who observes a sequence of length $n \geq k$ and selects the $k$ largest values. We focus on the widely adopted class of single-threshold algorithms and fully characterize their $(1-\varepsilon)$-competition complexity. Notably, our results reveal a sharp competition-induced phase transition: in the absence of competition, single-threshold algorithms are fundamentally limited to a $1-1/\sqrt{2k\pi}$ fraction of the prophet value, whereas even a $1\%$ multiplicative increase beyond $n$ observations suffices to achieve a $1-\exp(-\Theta(k))$ fraction. Another notable result happens when $k=1$: we show that the $(1-\varepsilon)$-competition complexity is exactly $\ln(1/\varepsilon)$, fully resolving an open question by Brustle et al. [Math. Oper. Res. 2024]. Our analysis is based on infinite-dimensional linear programming and duality arguments.
Read the full abstract

Numerical Analysis

A parametrix for the surface Stokes equation

We introduce an integral equation formulation of the surface Stokes equations, constructed using two-dimensional Stokeslets. The resulting integral equations are Fredholm integral equations of the second kind and can be discretized to high order using standard tools. Since the resulting discrete linear systems are dense, we describe and analyze a proxy shell method to construct fast direct solvers for these systems. The properties of our integral equation, and the performance of the resulting numerical scheme, are illustrated with several representative numerical examples.
Read the full abstract

All authors Tristan Goodwill, Jeremy Hoskins, Zydrunas Gimbutas, Bowei Wu

Spectral Theory

Improved fractal Weyl bounds matching improved spectral gaps for hyperbolic surfaces and open quantum maps

We prove a new fractal Weyl upper bound for the high-energy distribution of resonances of convex co-compact hyperbolic surfaces which matches the improved spectral gap given by Fourier decay. This improves upon the fractal Weyl bound of Dyatlov which matches the Patterson-Sullivan spectral gap. We also give a new resolvent estimate improving the ones given by Dyatlov-Zahl and Dyatlov. Analogous results are obtained for quantum open baker's maps, improving an estimate of Dyatlov-Jin, where we also give an improved fractal Weyl bound matching a spectral gap given by additive energy estimates. We refine known methods for proving fractal Weyl bounds which reduce the problem to an estimate of a certain determinant function; however, we use a different determinant function which allows us to make sharper estimates by applying the methods of proof of the fractal uncertainty principle in each setting.
Read the full abstract

Numerical Analysis

The largest 5th pivot may be the root of a 61st degree polynomial

This paper introduces a number of new techniques in the study of the famous question from numerical linear algebra: what is the largest possible growth factor when performing Gaussian elimination with complete pivoting? This question is highly complex, due to a complicated set of polynomial inequalities that need to be simultaneously satisfied. This paper introduces the JuMP + Groebner basis + discriminant polynomial approach as well as the use of interval arithmetic computations. Thus, we are introducing a marriage of numerical and exact mathematical computations. In 1988, Day and Peterson performed numerical optimization on $n=5$ with NPSOL and obtained a largest seen value of $4.1325...$. This same best value was reproduced by Gould with LANCELOT in 1991. We ran extensive comparable experiments with the modern software tool JuMP and also saw the same value $4.1325...$. While the combinatorial explosion of possibilities prevents us from knowing whether there may not be a larger maximum, we succeed in obtaining the exact mathematical value: the number $4.1325...$ is exactly the root of a 61st degree polynomial provided in this work, and is a maximum given the equality constraints seen by JuMP. In light of the numerics, we pose the conjecture that this lower bound is indeed the maximum. We also apply this technique to $n = 6$, $7$, and $8$. Furthermore, in 1969, an upper bound of $4\frac{17}{18}\approx 4.94$ was produced for the maximum possible growth for $n = 5$. We slightly lower this upper bound to $4.84$.
Read the full abstract

Symplectic Geometry

$C^0$-Poisson geometry, coisotropic submanifolds, and clean intersection points

In this work, we initiate the study of rigidity and non-rigidity phenomena for Poisson homeomorphisms, defined as uniform $C^0$-limits of Poisson diffeomorphisms. First, we prove that Poisson homeomorphisms preserve the singular symplectic foliation: they map symplectic leaves to symplectic leaves by symplectic homeomorphisms. Second, we establish the $C^0$-rigidity of coisotropic submanifolds in Poisson manifolds. A key ingredient is the notion of ”clean intersection point” between a submanifold and the leaves of a singular foliation, whose study is of independent interest for singular foliation theory and Poisson geometry. In contrast with the symplectic case, characteristic foliations of coisotropic submanifolds are not rigid under Poisson homeomorphisms, exhibiting flexibility phenomena specific to the Poisson setting. We discuss partial rigidity results, introduce a topological invariant of coisotropic submanifolds, the $C^0$-characteristic partition, and show that $C^0$-coisotropic submanifolds are non-smooth objects whose vanishing ideal defines a Lie subalgebra of the Poisson algebra. Finally, we consider Poisson homeomorphisms that lift to symplectic homeomorphisms of a symplectic realization and show that nearly all Poisson manifolds admit non-liftable Poisson homeomorphisms. Our main results answer three questions posed by Joksimović and Mărcuţ.
Read the full abstract

Number Theory

On Wagstaff primes in the $k$-Lucas number sequence

A Wagstaff prime is a prime number of the form $(2^{\mathfrak{p}}+1)/3$, where $\mathfrak{p}$ is an odd prime. Let $(L_n^{(k)})_{n\geq 2-k}$ be the $k$-Lucas number sequence defined by the recurrence relation $ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)}$, for all $n \ge 2$, with initial terms \( L_0^{(k)} = 2 \) and \( L_1^{(k)} = 1 \) for all \( k \ge 2 \), and \( L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)} = 0 \) for \( k \ge 3 \). In this paper, we show that the only solutions to the Diophantine equation $L_n^{(k)} = (2^{\mathfrak{p}}+1)/3$ are $(n,k,\mathfrak{p})\in\{(5,2,5),(6,4,7)\}\cup \{(2,k,3):k\ge 2\}$. We use linear forms in logarithms and the LLL reduction method to prove our result.
Read the full abstract

Geometric Topology

Wild knots embedded in the Menger Sponge

In this paper, we provide explicit recursive constructions of infinitely many non-equivalent wild knots contained in the Menger sponge, in such a way that we can control their set of wild points that lies in a usual Cantor set contained in the Menger sponge. Furthermore, we show that wild knots of dynamically defined type arising from Kleinian group actions can be isotoped into the sponge. We want to emphasize that our approach is constructive and geometric.
Read the full abstract

All authors Gabriela Hinojosa, Ulises Morales-Fuentes, Rogelio Valdez, Alberto Verjovsky