Tootfinder

A Novel Feedforward Youla Parameterization Method for Avoiding Local Minima in Stereo Image Based Visual Servoing Control
Rongfei Li, Francis Assadian
https://arxiv.org/abs/2506.10252

A Novel Feedforward Youla Parameterization Method for Avoiding Local Minima in Stereo Image Based Visual Servoing Control
In robot navigation and manipulation, accurately determining the camera's pose relative to the environment is crucial for effective task execution. In this paper, we systematically prove that this problem corresponds to the Perspective-3-Point (P3P) formulation, where exactly three known 3D points and their corresponding 2D image projections are used to estimate the pose of a stereo camera. In image-based visual servoing (IBVS) control, the system becomes overdetermined, as the 6 degrees of fre…

S-shaped Utility Maximization with VaR Constraint and Partial Information
Dongmei Zhu, Ashley Davey, Harry Zheng
https://arxiv.org/abs/2506.10103 https://

S-shaped Utility Maximization with VaR Constraint and Partial Information
We study S-shaped utility maximisation with VaR constraint and unobservable drift coefficient. Using the Bayesian filter, the concavification principle, and the change of measure, we give a semi-closed integral representation for the dual value function and find a critical wealth level that determines if the constrained problem admits a unique optimal solution and Lagrange multiplier or is infeasible. We also propose three algorithms (Lagrange, simulation, deep neural network) to solve the prob…

Gromov's reconstruction theorem and measured Gromov-Hausdorff convergence in Lorentzian geometry
Mathias Braun, Clemens S\"amann
https://arxiv.org/abs/2506.10852

Gromov's reconstruction theorem and measured Gromov-Hausdorff convergence in Lorentzian geometry
We establish Gromov's celebrated reconstruction theorem in Lorentzian geometry. Alongside this result, we introduce and study a natural concept of isomorphy of normalized bounded Lorentzian metric measure spaces. We outline applications to the spacetime reconstruction problem from causal set theory. Lastly, we propose three notions of convergence of (isomorphism classes of) normalized bounded Lorentzian metric measure spaces, for which we prove several fundamental properties.

This https://arxiv.org/abs/2405.08485 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Doubly relaxed forward-Douglas--Rachford splitting for the sum of two nonconvex and a DC function
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems whose objective function is the sum of three nonconvex functions, one of which is expressed in a difference-of-convex (DC) form. This problem class covers several important structures in the literature including the sum of three functions and the general DC program. We propose a splitting algorithm and prove the subsequential convergence to a stationary point of the problem. The full sequential convergenc…

This https://arxiv.org/abs/2501.02529 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Prime Multiple Missing Graphs
The famous Goldbach conjecture remains open for nearly three centuries. Recently Goldbach graphs are introduced to relate the problem with the literature of Graph Theory. It is shown that the connectedness of the graphs is equivalent to the affirmative answer of the conjecture. Some modified version of the graphs, say, near Goldbach graphs are shown to be Hamiltonian for small number of vertices. In this context, we introduce a class of graphs, namely, prime multiple missing graphs such that ne…

Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies
Maria Gabriela Jord\~ao Oliveira, Nina Glaser
https://arxiv.org/abs/2506.09971

Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies
Determining eigenvalues is a computationally expensive task that is crucial for countless applications in natural sciences. Toward this end, we introduce the quantum block Krylov subspace projector (QBKSP) algorithm, a multireference quantum variant of the Lanczos algorithm designed to accurately compute low-lying eigenvalues, including degenerate states. We present three different compact quantum circuits to evaluate the required expectation values, each suited to different problem settings. T…

The Riemann problem for three-phase foam flow in porous media
Luis Fernando Lozano, Grigori Chapiro, Dan Marchesin
https://arxiv.org/abs/2506.08152 https:/…

The Riemann problem for three-phase foam flow in porous media
Gas injection in the context of the three-phase flow in porous media appears in applications such as Enhanced Oil Recovery, aquifer remediation, and carbon capture, utilization, and storage (CCUS). In general, this technique suffers from a difficulty related to excessive gas mobility, which can be circumvented by using foam. This study addresses the non-linear system of differential equations describing the three-phase foam flow based on Corey relative permeability functions. A major obstacle i…

Maximizing higher eigenvalues in dimensions three and above
Denis Vinokurov
https://arxiv.org/abs/2506.09328 https://arxiv.org/pdf/25…

Maximizing higher eigenvalues in dimensions three and above
We study the problem of maximizing the $k$-th eigenvalue functional over the class of absolutely continuous measures on a closed Riemannian manifold of dimension $m\geq 3$. For dimensions $3 \leq m \leq 6$, we generalize the work of Karpukhin and Stern on the first eigenvalue, showing that the maximizing measures are realized by smooth harmonic maps into finite-dimensional spheres. For $m \geq 7$, the maximizing measures are again induced by harmonic maps, which may now exhibit singularitie…

This https://arxiv.org/abs/2402.07660 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Rényi Resolvability, Noise Stability, and Anti-contractivity
This paper investigates three closely related topics -- Rényi resolvability, noise stability, and anti-contractivity. The Rényi resolvability problem refers to approximating a target output distribution of a given channel in the Rényi divergence when the input is set to a function of a given uniform random variable. This problem for the Rényi parameter in $(0,2]\cup\{\infty\}$ was first studied by the present author and Tan in 2019. In the present paper, we provide a complete solution to th…

High-density three-dimensional holography using rapid modulation of light
Jorge-Alberto Peralta-\'Angeles, Mingyuan Hong, Mario A. Quiroz-Ju\'arez, Omar S. Maga\~na-Loaiza, Roberto de J. Le\'on-Montiel
https://arxiv.org/abs/2506.08253

High-density three-dimensional holography using rapid modulation of light
One of the most common methods for reconstructing three-dimensional (3D) images of real objects is digital holography. This technique relies on the use of electro-optical devices that modify the phase or amplitude of light fields in a controlled manner, the so-called spatial light modulators. However, given that holography typically requires coherent light sources, a common problem with three-dimensional projection is the crosstalk between the layers that make up the 3D object. This limits full…

Machine learning method for enforcing variable independence in background estimation with LHC data: ABCDisCoTEC
CMS Collaboration
https://arxiv.org/abs/2506.08826

Machine learning method for enforcing variable independence in background estimation with LHC data: ABCDisCoTEC
A novel solution is presented for the problem of estimating the backgrounds of a signal search using observed data while simultaneously maximizing the sensitivity of the search to the signal. The ``ABCD method'' provides a reliable framework for background estimation by partitioning events into one signal-enhanced region (A) and three background-enhanced control regions (B, C, and D) via two statistically independent variables. In practice, even slight correlations between the two variables can…

A posteriori error estimates for a $C^1$ virtual element method applied to the thin plate vibration problem
Franco Dassi, Andres E. Rubiano, Iv\'an Vel\'asquez
https://arxiv.org/abs/2507.06846

A posteriori error estimates for a $C^1$ virtual element method applied to the thin plate vibration problem
We propose and analyse residual-based a posteriori error estimates for the virtual element discretisation applied to the thin plate vibration problem in both two and three dimensions. Our approach involves a conforming $C^1$ discrete formulation suitable for meshes composed of polygons and polyhedra. The reliability and efficiency of the error estimator are established through a dimension-independent proof. Finally, several numerical experiments are reported to demonstrate the optimal performan…

Natura Urbana VII 🏡
城市自然 VII 🏡
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

This https://arxiv.org/abs/2306.07237 has been replaced.
link: https://scholar.google.com/scholar?q=a

Three Edge-disjoint Plane Spanning Paths in a Point Set
We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths are allowed to intersect at arbitrary points. It is known that if the points of $S$ are in convex position, then $\lfloor n/2 \rfloor$ such paths always exist. However, for general point sets, the best known construction yields only two edge-disjoint plane sp…

Beyond Robustness: Learning Unknown Dynamic Load Adaptation for Quadruped Locomotion on Rough Terrain
Leixin Chang, Yuxuan Nai, Hua Chen, Liangjing Yang
https://arxiv.org/abs/2507.07825

Beyond Robustness: Learning Unknown Dynamic Load Adaptation for Quadruped Locomotion on Rough Terrain
Unknown dynamic load carrying is one important practical application for quadruped robots. Such a problem is non-trivial, posing three major challenges in quadruped locomotion control. First, how to model or represent the dynamics of the load in a generic manner. Second, how to make the robot capture the dynamics without any external sensing. Third, how to enable the robot to interact with load handling the mutual effect and stabilizing the load. In this work, we propose a general load modeling…

A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems
Shabnam Khodakaramzadeh, Soroosh Shafiee, Gabriel de Albuquerque Gleizer, Peyman Mohajerin Esfahani
https://arxiv.org/abs/2506.09776

A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems
We study the factor model problem, which aims to uncover low-dimensional structures in high-dimensional datasets. Adopting a robust data-driven approach, we formulate the problem as a saddle-point optimization. Our primary contribution is a general first-order algorithm that solves this reformulation by leveraging a linear minimization oracle (LMO). We further develop semi-closed form solutions (up to a scalar) for three specific LMOs, corresponding to the Frobenius norm, Kullback-Leibler diver…

Bifurcation from periodic solutions of central force problems in the three-dimensional space
Alberto Boscaggin, Guglielmo Feltrin, Duccio Papini
https://arxiv.org/abs/2506.05842

Bifurcation from periodic solutions of central force problems in the three-dimensional space
The paper deals with electromagnetic perturbations of a central force problem of the form \begin{equation*} \dfrac{\mathrm{d}}{\mathrm{d}t} \bigl( φ(\dot{x}) \bigr) = V'(|x|) \dfrac{x}{|x|} + E_{\varepsilon}(t,x)+\dot{x} \wedge B_{\varepsilon}(t,x), \qquad x \in \mathbb{R}^3 \setminus \{0\}, \end{equation*} where $V \colon (0,+\infty) \to \mathbb{R}$ is a smooth function, $E_\varepsilon$ and $B_\varepsilon$ are respectively the electric field and the magnetic field, smooth …

Hodge Duals in Spherical Compactifications
Arash Azizi
https://arxiv.org/abs/2507.06324 https://arxiv.org/pdf/2507.06324

Hodge Duals in Spherical Compactifications
We present a general formalism for computing the Hodge dual of differential forms in arbitrary dimensions subject to a spherical constraint. This problem arises naturally in Kaluza-Klein compactifications, where sphere reductions demand careful treatment of differential forms constrained to lie on embedded submanifolds. We derive an explicit expression for the Hodge dual of a $p$-form in the presence of such constraints and validate our general ansatz through illustrative examples in three dime…

Gordian split links in the Gehring ropelength problem
Friedrich Bauermeister
https://arxiv.org/abs/2506.04644 https://arxiv.org/pdf/2…

Gordian split links in the Gehring ropelength problem
A thick link is a link in Euclidean three-space such that each component of the link lies at distance at least 1 from every other component. Strengthening the notion of thickness, we define a thickly embedded link to be a thick link whose open radius-1/2 normal disk bundles of all components are embedded. The Gehring ropelength problem asks how large the sum of the lengths of the components of a thick (respectively thickly embedded) link must be, given the link homotopy (respectively isotopy) c…

Probably a good day 🥵 to remind of our CoolWalks study: https://www.nature.com/articles/s41598-025-97200-2
- Above all, stop burning fossil fuels
- Buildings (and trees) cast a lot of shade in cities. We systematically quantify the benefits for 🚶🚴
- Make sha…

CoolWalks for active mobility in urban street networks - Scientific Reports
Walking is the most sustainable form of urban mobility, but is compromised by uncomfortable or unhealthy sun exposure, which is an increasing problem due to global warming. Shade from buildings can provide cooling and protection for pedestrians, but the extent of this potential benefit is unknown. Here we explore the potential for shaded walking, using building footprints and street networks from both synthetic and real cities. We introduce a route choice model with a sun avoidance parameter $$…

This https://arxiv.org/abs/2505.09708 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

The uncertainty of magnetic fields in 3D non-local thermodynamic equilibrium inversions
We describe our approach to solve the problem of ensuring the solenoidality of the magnetic field vector in three-dimensional (3D) inversions, as well as the estimation of the uncertainty in the inferred magnetic field. The solenoidality of the magnetic field vector is often disregarded in the inversion of spectropolarimetric data due to limitations in the traditional one-dimensional inversion techniques. We propose a method to ensure the solenoidal condition in 3D inversions based on our meshf…

Optimization of Transfers linking Ballistic Captures to Earth-Moon Periodic Orbit Families
Lorenzo Ano\`e, Roberto Armellin, Jack Yarndley, Thomas Caleb, St\'ephanie Lizy-Destrez
https://arxiv.org/abs/2507.04739

Optimization of Transfers linking Ballistic Captures to Earth-Moon Periodic Orbit Families
The design of transfers to periodic orbits in the Earth--Moon system has regained prominence with NASA's Artemis and CNSA's Chang'e programs. This work addresses the problem of linking ballistic capture trajectories - exploiting multi-body dynamics for temporary lunar orbit insertion - with bounded periodic motion described in the circular restricted three-body problem (CR3BP). A unified framework is developed for optimizing bi-impulsive transfers to families of periodic orbits via a high-order…

Consecutive collision orbits in the restricted three-body problem above the first critical energy value
Jungsoo Kang, Kevin Ruck
https://arxiv.org/abs/2506.01735

Consecutive collision orbits in the restricted three-body problem above the first critical energy value
In this paper, we study the planar circular restricted three-body problem for energy levels slightly above the first critical value. We first observe that the energy hypersurfaces in the Birkhoff regularization corresponding to these energy levels are of contact type. Then, using a version of Rabinowitz Floer homology and an analytic continuation argument, we establish the existence of a symmetric consecutive collision orbit and, furthermore, prove the existence of infinitely many such orbits f…

A Directed Lazy Random Walk Model to Three-Way Dynamic Matching Problem
Souvik Roy, Agamani Saha
https://arxiv.org/abs/2507.06126 https://

A Directed Lazy Random Walk Model to Three-Way Dynamic Matching Problem
This paper explores a novel extension of dynamic matching theory by analyzing a three-way matching problem involving agents from three distinct populations, each with two possible types. Unlike traditional static or two-way dynamic models, our setting captures more complex team-formation environments where one agent from each of the three populations must be matched to form a valid team. We consider two preference structures: assortative or homophilic, where agents prefer to be matched with oth…

A Concept for Autonomous Problem-Solving in Intralogistics Scenarios
Johannes Sigel, Daniel Dittler, Nasser Jazdi, Michael Weyrich
https://arxiv.org/abs/2507.03534

A Concept for Autonomous Problem-Solving in Intralogistics Scenarios
Achieving greater autonomy in automation systems is crucial for handling unforeseen situations effectively. However, this remains challenging due to technological limitations and the complexity of real-world environments. This paper examines the need for increased autonomy, defines the problem, and outlines key enabling technologies. A structured concept is proposed, consisting of three main steps: context enrichment, situation analysis, and generation of solution strategies. By following this …

Constraining the Baryon Fraction in the Intergalactic Medium with 92 localized Fast Radio Bursts
Yang Liu, Yuchen Zhang, Hongwei Yu, Puxun Wu
https://arxiv.org/abs/2506.03536

Constraining the Baryon Fraction in the Intergalactic Medium with 92 localized Fast Radio Bursts
Fast radio bursts (FRBs) are emerging as powerful cosmological probes for constraining the baryon fraction in the intergalactic medium (IGM), offering a promising avenue to address the missing baryon problem. In this paper, we analyze constraints on the IGM baryon fraction ($f_\mathrm{IGM}$) using 92 localized FRBs, incorporating a corrected probability distribution function for the IGM dispersion measure within three different cosmological models. We find that variations in the underlying cosm…

Best approximation of a three-variable function by sum of one-variable coordinate functions
Rashid A. Aliev, Vugar A. Guliyev, Amil F. Jabiyev
https://arxiv.org/abs/2507.04747

Best approximation of a three-variable function by sum of one-variable coordinate functions
Consider the following approximation problem of a continuous function of three variables by the sum of three continuous functions of one variable: \[ E(f,Ω)=\inf||f(x,y,z)-ϕ(x)-ψ(y)-ω(z)||_{\infty}=? \] where $f(x,y,z)$ is a given continuous function defined on $Ω=[0,1]^3$ and the infimum runs over all triplets of continuous functions $ϕ(x),ψ(y),ω(z)$ defined on the unit interval $[0,1]$. In this paper, we will prove a formula to calculate the error $E(f,Ω)$ und…

Admissibility of Completely Randomized Trials: A Large-Deviation Approach
Guido Imbens, Chao Qin, Stefan Wager
https://arxiv.org/abs/2506.05329 https://

Admissibility of Completely Randomized Trials: A Large-Deviation Approach
When an experimenter has the option of running an adaptive trial, is it admissible to ignore this option and run a non-adaptive trial instead? We provide a negative answer to this question in the best-arm identification problem, where the experimenter aims to allocate measurement efforts judiciously to confidently deploy the most effective treatment arm. We find that, whenever there are at least three treatment arms, there exist simple adaptive designs that universally and strictly dominate non…

Tied Pools and Drawn Games
Roderick Edwards
https://arxiv.org/abs/2507.03894 https://arxiv.org/pdf/2507.03894

Tied Pools and Drawn Games
We consider the problem of estimating `preference' or `strength' parameters in three-way comparison experiments, each composed of a series of paired comparisons, but where only the single `preferred' or `strongest' candidate is known in each trial. Such experiments arise in psychology and market research, but here we use chess competitions as the prototypical context, in particular a series of `pools' between three players that occurred in 1821. The possibilities of tied pools, redundant and th…

Three bound states with prescribed angular momentum to the cubic-quintic NLS equations in $\mathbb{R}^{3}$
Shuai Yao, Juntao Sun
https://arxiv.org/abs/2507.04057

Three bound states with prescribed angular momentum to the cubic-quintic NLS equations in $\mathbb{R}^{3}$
In this paper, we investigate bound states with prescribed angular momentum and mass for the nonlinear Schrödinger equations (NLS) with the cubic-quintic nonlinearity in dimensions three. We demonstrate that there exist three solutions for the double constrained problem: a local minimizer, a mountain pass type solution, and a global minimizer. Moreover, by means of the minimax method, we construct a new mountain pass path and further obtain the geometric link among the three solutions as well …

This https://arxiv.org/abs/2412.17556 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_grqc_…

Bekenstein bounds in maximally symmetric nonlinear electrodynamics
We explore dynamical features of the maximally symmetric nonlinear extension of classical electromagnetism, recently proposed in the literature as ``ModMax'' electrodynamics. This family of theories is the only one that preserves all the symmetries of Maxwell's theory, having applications in the study of regular black hole solutions and supersymmetry. The purpose of this article is three-fold. Firstly, we study the initial-value problem of ModMax and show, by means of a simple geometric criteri…

One task to rule them all: A closer look at traffic classification generalizability
Elham Akbari, Zihao Zhou, Mohammad Ali Salahuddin, Noura Limam, Raouf Boutaba, Bertrand Mathieu, Stephanie Moteau, Stephane Tuffin
https://arxiv.org/abs/2507.06430

One task to rule them all: A closer look at traffic classification generalizability
Existing website fingerprinting and traffic classification solutions do not work well when the evaluation context changes, as their performances often heavily rely on context-specific assumptions. To clarify this problem, we take three prior solutions presented for different but similar traffic classification and website fingerprinting tasks, and apply each solution's model to another solution's dataset. We pinpoint dataset-specific and model-specific properties that lead each of them to overpe…

Evaluation of LLMs for mathematical problem solving
Ruonan Wang, Runxi Wang, Yunwen Shen, Chengfeng Wu, Qinglin Zhou, Rohitash Chandra
https://arxiv.org/abs/2506.00309

Evaluation of LLMs for mathematical problem solving
Large Language Models (LLMs) have shown impressive performance on a range of educational tasks, but are still understudied for their potential to solve mathematical problems. In this study, we compare three prominent LLMs, including GPT-4o, DeepSeek-V3, and Gemini-2.0, on three mathematics datasets of varying complexities (GSM8K, MATH500, and UNSW datasets). We take a five-dimensional approach based on the Structured Chain-of-Thought (SCoT) framework to assess final answer correctness, step com…

This https://arxiv.org/abs/2501.01817 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Distributed Framework Construction for Affine Formation Control
In affine formation control problems, the construction of the framework with universal rigidity and affine localizability is a critical prerequisite, but it has not yet been well addressed, especially when additional agents join the formation or link/agent failures emerge. Motivated by this observation, we investigate the problem of constructing affine frameworks in three scenarios, including vertex addition, edge deletion and vertex deletion. Our approach starts from the original affine format…

This https://arxiv.org/abs/2501.00671 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Sylvester's problem for beta-type distributions
Consider $d+2$ i.i.d. random points $X_1,\ldots, X_{d+2}$ in $\mathbb R^d$. In this note, we compute the probability that their convex hull is a simplex focusing on three specific distributional settings: (i) the distribution of $X_1$ is multivariate standard normal; (ii) the density of $X_1$ is proportional to $(1-\|x\|^2)^β$ on the unit ball (the beta distribution); (iii) the density of $X_1$ is proportional to $(1+\|x\|^2)^{-β}$ (the beta prime distribution). In the Gau…

Some Properties of Twisted Chevalley Groups
Deep H. Makadiya
https://arxiv.org/abs/2505.24430 https://arxiv.org/pdf/2505.24430…

Some Properties of Twisted Chevalley Groups
This thesis investigates certain structural properties of twisted Chevalley groups over commutative rings, focusing on three key problems. Let $R$ be a commutative ring satisfying mild conditions. Let $G_{π,σ} (Φ, R)$ denote a twisted Chevalley group over $R$, and let $E'_{π, σ} (Φ, R)$ denote its elementary subgroup. The first problem concerns the normality of $E'_{π, σ} (Φ, R, J)$, the relative elementary subgroups at level $J$, in the group $G_{π, σ} (Φ, R)$. The second problem…

Global strong solution of the 3D compressible liquid crystal flows with density-dependent viscosity and large velocity
Jiaxu Li, Yu Mei, Rong Zhang
https://arxiv.org/abs/2507.04760

Global strong solution of the 3D compressible liquid crystal flows with density-dependent viscosity and large velocity
This paper concerns the Cauchy problem of three-dimensional compressible liquid crystal flows with density-dependent viscosity. When the viscosity coefficients $μ_1(ρ),μ_2(ρ)$ are power functions of the density with the power larger than $1$, it is proved that the system exists a unique global strong solution as long as the initial density is sufficiently large and $L^3$-norm of the derivative of the initial director is sufficiently small. This is the first result concerning the global stro…

This https://arxiv.org/abs/2405.10886 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Three-mode tunable coupler for superconducting two-qubit gates
Building a scalable universal high-performance quantum processor is a formidable challenge. In particular, the problem of realizing fast high-perfomance two-qubit gates of high-fidelity remains needful. Here we propose a building block for a scalable quantum processor consisting of two transmons and a tunable three-mode coupler allowing for a ZZ interaction control. We experimentally demonstrate the native CZ gate with the pulse duration of 60 ns achieving the two-qubit gate fidelity above 98%,…

This https://arxiv.org/abs/2501.02485 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Semi-analytic construction of global transfers between quasi-periodic orbits in the spatial R3BP
Consider the spatial restricted three-body problem, as a model for the motion of a spacecraft relative to the Sun-Earth system. We focus on the dynamics near the equilibrium point $L_1$, located between the Sun and the Earth. We show that we can transfer the spacecraft from a quasi-periodic orbit that is nearly planar relative to the ecliptic to a quasi-periodic orbit that has large vertical amplitude, at zero energy cost. (In fact, the final orbit has the maximum vertical amplitude that can be…

This https://arxiv.org/abs/2412.16671 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Bi-normal trajectories in the Circular Restricted Three-Body Problem
In this note, we show there exist infinitely many trajectories which are bi-normal (i.e. normal at initial and final times) to the xz-plane, in the Spatial Circular Restricted Three-Body Problem, for energies below or slightly above the first critical value and near the primaries, under the assumption of the twist condition as defined by Moreno-van-Koert in arXiv:2011.06562. This is an application of the relative Poincaré-Birkhoff theorem for Lagrangians in Liouville domains, as proven by the …

Democrats have an age problem
House Republicans managed to pass their draconian budget bill,
-- which promises to make massive cuts to Medicaid, Medicare, and food assistance,
-- early Thursday morning by a narrow one-vote margin
💥that was only possible due the deaths of three Democrats in this current Congress. 
The latest Democrat to pass away was 75-year-old Representative Gerry Connolly of Virginia, who died on Wednesday after battling esophageal cancer.

Republicans Pass Horrid Tax Bill Thanks to Democrats Dying in Office
Republicans passed their terrible tax bill by one vote. Guess how many Democrats died in office this year.

A Proximal Variable Smoothing for Minimization of Nonlinearly Composite Nonsmooth Function -- Maxmin Dispersion and MIMO Applications
Keita Kume, Isao Yamada
https://arxiv.org/abs/2506.05974

A Proximal Variable Smoothing for Minimization of Nonlinearly Composite Nonsmooth Function -- Maxmin Dispersion and MIMO Applications
We propose a proximal variable smoothing algorithm for a nonsmooth optimization problem whose cost function is the sum of three functions including a weakly convex composite function. The proposed algorithm has a single-loop structure inspired by a proximal gradient-type method. More precisely, the proposed algorithm consists of two steps: (i) a gradient descent of a time-varying smoothed surrogate function designed partially with the Moreau envelope of the weakly convex function; (ii) an appli…

The Word Problem for Products of Symmetric Groups
Hans U. Simon
https://arxiv.org/abs/2506.13655 https://arxiv.org/pdf/2506.13655

The Word Problem for Products of Symmetric Groups
The word problem for products of symmetric groups (WPPSG) is a well-known NP-complete problem. An input instance of this problem consists of ``specification sets'' $X_1,\ldots,X_m \seq \{1,\ldots,n\}$ and a permutation $τ$ on $\{1,\ldots,n\}$. The sets $X_1,\ldots,X_m$ specify a subset of the symmetric group $\cS_n$ and the question is whether the given permutation $τ$ is a member of this subset. We discuss three subproblems of WPPSG and show that they can be solved efficiently. The subproble…

This https://arxiv.org/abs/2404.10304 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

LLM-Powered Test Case Generation for Detecting Bugs in Plausible Programs
Detecting tricky bugs in plausible programs, those that pass existing test suites yet still contain bugs, remains a significant challenge in software testing. To address this problem, we propose TrickCatcher, an LLM-powered approach to generating test cases for uncovering bugs in plausible programs. TrickCatcher operates in three stages: First, it uses an LLM to generate program variants based on the program under test (PUT) and its specification. Second, it employs an LLM to construct an input…

City Corners 🏙️
城市角落 🏙️
📷 Minolta Hi-Matic AF
🎞️ILFORD FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Deformation Due to Non-planar Fault Movement in Fractional Maxwell Medium
Pabita Mahato (Mondal), Seema Sarkar (Mondal), Subhash Chandra (Mondal)
https://arxiv.org/abs/2506.04257 …

Deformation Due to Non-planar Fault Movement in Fractional Maxwell Medium
In seismically active regions, the accumulation of geophysical stress during the aseismic period and its impact on faults is crucial for identifying which faults are more likely to undergo future fault movement. In this model, we consider an infinite non-planar fault located in a viscoelastic half-space of a fractional Maxwell medium representing the lithosphere-asthenosphere system comprising three interconnected planar sections. The problem is formulated as a two-dimensional boundary value pr…

Spherically Symmetric Accretion with Self-Gravity: Analytical Formulae and Numerical Validation
Cheng-Liang Jiao, Er-gang Zhao, Liying Zhu, Xiang-dong Shi
https://arxiv.org/abs/2507.02621

Spherically Symmetric Accretion with Self-Gravity: Analytical Formulae and Numerical Validation
Spherically symmetric accretion incorporating self-gravity constitutes a three-point boundary value problem (TPBVP) governed by constraints at the outer boundary, sonic point, and accretor surface. Previous studies have two limitations: either employing an incorrect formula for self-gravity potential in analytical treatments, or introducing additional input parameters in numerical implementations to circumvent solving the full TPBVP. To address these issues, we present a self-consistent TPBVP f…

This https://arxiv.org/abs/2407.10571 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Spanning Trees Minimizing Branching Costs
The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$. This problem, known to be NP-hard, has attracted significant attention due to its importance in network design and optimization. Extensive research has been conducted on the algorithmic and combinatorial aspects of this problem, with recent studies delving into its fixed-parameter tractability. In this …

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
David Eppstein
https://arxiv.org/abs/2507.04538 https://arxiv.org/pdf/…

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
We show that the max-min-angle polygon in a planar point set can be found in time $O(n\log n)$ and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be found in time $O(n^2)$. We also study the maxmin-angle polygonal curve in 3d, which we show to be $\mathsf{NP}$-hard to find if repetitions are forbidden but can be found in near-cubic time if repeated vertices or line segments are allowed, by reducing the problem to finding a bottleneck cycle in a graph. We formalize …

Monolithic framework to simulate fluid-structure interaction problems using geometric volume-of-fluid method
Soham Prajapati (Department of Aerospace Engineering and Mechanics, University of Minnesota - Twin Cities, Minneapolis, Minnesota, USA), Ali Fakhreddine (Department of Aerospace Engineering and Mechanics, University of Minnesota - Twin Cities, Minneapolis, Minnesota, USA), Krishnan Mahesh (Department of Aerospace Engineering and Mechanics, University of Minnesota - Twin Cities, …

Monolithic framework to simulate fluid-structure interaction problems using geometric volume-of-fluid method
We develop a three-dimensional Eulerian framework to simulate fluid-structure interaction (FSI) problems on a fixed Cartesian grid using the geometric volume-of-fluid (VOF) method. The coupled problem involves incompressible flow and viscous hyperelastic solids. A VOF-based one-continuum formulation is used to describe the unified momentum conservation equations with incompressibility constraints that are solved using the finite volume method (FVM). In the geometric VOF interface-capturing (IC)…

This https://arxiv.org/abs/2306.11707 has been replaced.
link: https://scholar.google.com/scholar?q=a

Hexagonal circular 3-webs with reducible polar curves of degree three
The paper reports the progress with the classical problem, posed by Blaschke and Bol in 1938. We present new examples and new classifications of natural classes of hexagonal circular 3-webs. The main results is the classification of hexagonal circular 3-webs with reducible polar curves of degree 3 and description of hexagonal circular 3-webs admitting a one-parameter Möbius symmetry.

Light Curve Analysis Of W-uma Type Binary Systems Rz Umi, Oq Uma, Lp Uma
Marko Grozdanovi\'c, Gojko {\DJ}ura\v{s}evi\'c
https://arxiv.org/abs/2507.00768

Light Curve Analysis Of W-uma Type Binary Systems Rz Umi, Oq Uma, Lp Uma
This study presents new, high-quality, optical photometric observations of three W UMa type contact binaries. The analysis of the corresponding light curves is made using Djurasevic's inverse problem method. To explain the light curve asymmetries and variations, we used the Roche model that involved regions containing spots on the components. The fundamental parameters of these systems were derived, including the mass ratios determined using the q-search method. Hypotheses involving active surf…

Relationship between spin-glass three-dimensional (3D) Ising model and traveling salesman problems
Zhidong Zhang
https://arxiv.org/abs/2507.01914 https://

Relationship between spin-glass three-dimensional (3D) Ising model and traveling salesman problems
In this work, the relationship between a spin-glass three-dimensional (3D) Ising model with the lattice size N = mnl and the traveling salesman problem (TSP) in a 3D lattice is studied. In particular, the mathematical structures of the two systems are investigated in details. In both the hard problems, the nontrivial topological structures, the non-planarity graphs, the nonlocalities and/or the long-range spin entanglements exist, while randomness presents, which make the computation very compl…

An Improved Inference for IV Regressions
Liyu Dou, Pengjin Min, Wenjie Wang, Yichong Zhang
https://arxiv.org/abs/2506.23816 https://a…

An Improved Inference for IV Regressions
Researchers often report empirical results that are based on low-dimensional IVs, such as the shift-share IV, together with many IVs. Could we combine these results in an efficient way and take advantage of the information from both sides? In this paper, we propose a combination inference procedure to solve the problem. Specifically, we consider a linear combination of three test statistics: a standard cluster-robust Wald statistic based on the low-dimensional IVs, a leave-one-cluster-out Lagra…

Experimental Evidence for the Propagation and Preservation of Machine Discoveries in Human Populations
Levin Brinkmann, Thomas F. Eisenmann, Anne-Marie Nussberger, Maxim Derex, Sara Bonati, Valerii Chirkov, Iyad Rahwan
https://arxiv.org/abs/2506.17741

Experimental Evidence for the Propagation and Preservation of Machine Discoveries in Human Populations
Intelligent machines with superhuman capabilities have the potential to uncover problem-solving strategies beyond human discovery. Emerging evidence from competitive gameplay, such as Go, demonstrates that AI systems are evolving from mere tools to sources of cultural innovation adopted by humans. However, the conditions under which intelligent machines transition from tools to drivers of persistent cultural change remain unclear. We identify three key conditions for machines to fundamentally i…

Inverse scattering without phase: Carleman convexification and phase retrieval via the Wentzel--Kramers--Brillouin approximation
Thuy T. Le, Phuong M. Nguyen, Loc H. Nguyen
https://arxiv.org/abs/2506.21699

Inverse scattering without phase: Carleman convexification and phase retrieval via the Wentzel--Kramers--Brillouin approximation
This paper addresses the challenging and interesting inverse problem of reconstructing the spatially varying dielectric constant of a medium from phaseless backscattering measurements generated by single-point illumination. The underlying mathematical model is governed by the three-dimensional Helmholtz equation, and the available data consist solely of the magnitude of the scattered wave field. To address the nonlinearity and severe ill-posedness of this phaseless inverse scattering problem, w…

Improving statistical learning methods via features selection without replacement sampling and random projection
Sulaiman khan, Muhammad Ahmad, Fida Ullah, Carlos Aguilar Iba\~nez, Jos\'e Eduardo Valdez Rodriguez
https://arxiv.org/abs/2506.00053

Improving statistical learning methods via features selection without replacement sampling and random projection
Cancer is fundamentally a genetic disease characterized by genetic and epigenetic alterations that disrupt normal gene expression, leading to uncontrolled cell growth and metastasis. High-dimensional microarray datasets pose challenges for classification models due to the "small n, large p" problem, resulting in overfitting. This study makes three different key contributions: 1) we propose a machine learning-based approach integrating the Feature Selection Without Re-placement (FSWOR) technique…

Structural stability of three dimensional steady Prandtl equation
Weiming Shen, Yue Wang, Tong Yang
https://arxiv.org/abs/2506.04578 https://

Structural stability of three dimensional steady Prandtl equation
The well-posedness of the three dimensional Prandtl equation is an outstanding open problem due to the appearance of the secondary flow even though there are studies on analytic and Gevrey function spaces. This problem is raised as the third open problem in the classical book by Oleinik and Samokhin [43]. This paper aims to address this open problem in the steady case by introducing a new approach to study the structural stability of background profile that includes the famous Blasius solutions…

The Hexablock: a domain associated with the $\mu$-synthesis in $M_2(\mathbb C)$
Indranil Biswas, Sourav Pal, Nitin Tomar
https://arxiv.org/abs/2506.15149 h…

The Hexablock: a domain associated with the $μ$-synthesis in $M_2(\mathbb C)$
We study a new domain in $\mathbb C^4$, namely the hexablock $\mathbb{H}$ that arises in connection with a special case of the $μ$-synthesis problem in $M_2(\mathbb C)$. Previous attempts to study a few instances of the $μ$-synthesis problem led to domains such as symmetrized bidisc $\mathbb G_2$, tetrablock $\mathbb E$ and pentablock $\mathbb P$. Throughout, the relations of $\mathbb{H}$ with these three domains are explored. Several characterizations of the hexablock are established. We det…

Prediction of Protein Three-dimensional Structures via a Hardware-Executable Quantum Computing Framework
Yuqi Zhang, Yuxin Yang, William Martin, Kingsten Lin, Zixu Wang, Cheng-Chang Lu, Weiwen Jiang, Ruth Nussinov, Joseph Loscalzo, Qiang Guan, Feixiong Cheng
https://arxiv.org/abs/2506.22677

Prediction of Protein Three-dimensional Structures via a Hardware-Executable Quantum Computing Framework
Accurate prediction of protein active site structures remains a central challenge in structural biology, particularly for short and flexible peptide fragments where conventional methods often fail. Here, we present a quantum computing framework specifically developed for utility-level quantum processors to address this problem. Starting from an amino acid sequence, we formulate the structure prediction task as a ground-state energy minimization problem using the Variational Quantum Eigensolver …

Occlusion-Aware Ground Target Tracking by a Dubins Vehicle Using Visibility Volumes
Collin Hague, Artur Wolek
https://arxiv.org/abs/2506.03400 https://

Occlusion-Aware Ground Target Tracking by a Dubins Vehicle Using Visibility Volumes
This paper considers the problem of tracking a point of interest (POI) moving along a known trajectory on the ground with an uncrewed aerial vehicle (UAV) modeled as a Dubins vehicle using a line-of-sight (LOS) sensor through an urban environment that may occlude the POI. A visibility volume (VV) encodes a time-varying, three-dimensional representation of the sensing constraints for a particular POI position. A constant-altitude, translating, and radially time-varying circular standoff orbit is…

Modeling the Monty Hall Decision Problem with Reaction Kinetics
Oliver Steinbock, Wen Zhu
https://arxiv.org/abs/2505.15824 https://ar…

Modeling the Monty Hall Decision Problem with Reaction Kinetics
Using the Monty Hall probability problem as a model system, we ask whether simple chemical reaction mechanisms can implement optimal strategies for non-trivial decision making. In this puzzle, a contestant chooses one of three doors (only one hides a prize), the host, knowing the content, opens another door revealing no prize, and finally the contestant must decide whether to stay with the original choice or switch to the remaining closed door. Assigning distinct molecular species to the player…

Exact Renormalization Relation and Binding Energies for Three Identical Bosons
Langxuan Chen, Pengfei Zhang
https://arxiv.org/abs/2506.12531 https://

Exact Renormalization Relation and Binding Energies for Three Identical Bosons
In the low-energy limit, non-relativistic particles with short-range interactions exhibit universal behavior that is largely independent of microscopic details. This universality is typically described by effective field theory, in which the two-body interaction is renormalized to a single parameter-the scattering length. For systems of identical bosons, the three-body problem reveals the Efimov effect, a novel phenomenon proposed that necessitates the introduction of an additional three-body p…

This https://arxiv.org/abs/2503.17838 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Analysis of pitchfork bifurcations and symmetry breaking in the elliptic restricted three-body problem
A unified framework is proposed to quantitatively characterize pitchfork bifurcations and associated symmetry breaking in the elliptic restricted three-body problem (ERTBP). It is known that planar/vertical Lyapunov orbits and Lissajous orbits near the collinear libration points undergo pitchfork bifurcations with varying orbital energy. These bifurcations induce symmetry breaking, generating bifurcated families including halo/quasi-halo orbits, axial/quasi-axial orbits, and their corresponding…

Asymptotic analysis of high-dimensional uniformity tests under heavy-tailed alternatives
Tiefeng Jiang, Tuan Pham
https://arxiv.org/abs/2506.00393 https://…

Asymptotic analysis of high-dimensional uniformity tests under heavy-tailed alternatives
We study the high-dimensional uniformity testing problem, which involves testing whether the underlying distribution is the uniform distribution, given $n$ data points on the $p$-dimensional unit hypersphere. While this problem has been extensively studied in scenarios with fixed $p$, only three testing procedures are known in high-dimensional settings: the Rayleigh test \cite{Cutting-P-V}, the Bingham test \cite{Cutting-P-V2}, and the packing test \cite{Jiang13}. Most existing research focuses…

Characterization of Infinite Ideal Polyhedra in Hyperbolic 3-Space via Combinatorial Ricci Flow
Huabin Ge, Bobo Hua, Hao Yu, Puchun Zhou
https://arxiv.org/abs/2506.05036

Characterization of Infinite Ideal Polyhedra in Hyperbolic 3-Space via Combinatorial Ricci Flow
In his seminal work \cite{Ri96}, Rivin characterized finite ideal polyhedra in three-dimensional hyperbolic space. However, the characterization of infinite ideal polyhedra, as proposed by Rivin, has remained a long-standing open problem. In this paper, we introduce the combinatorial Ricci flow for infinite ideal circle patterns, a discrete analogue of Ricci flow on non-compact Riemannian manifolds, and prove a characterization of such circle patterns under certain combinatorial conditions. Our…

Making Graphs Irregular through Irregularising Walks
Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timoth\'ee Martinod
https://arxiv.org/abs/2506.21254

Making Graphs Irregular through Irregularising Walks
The 1-2-3 Conjecture, introduced by Karoński, Łuczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$, i.e., in which no two adjacent vertices have the same degree, by replacing some of its edges with at most three parallel edges. In this work, we introduce and study a restriction of this problem under the additional constraint that edges added to $G$ to reach $…

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
Vanja Stojanovi\'c, Bor Panger\v{s}i\v{c}
https://arxiv.org/abs/2507.01076

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
The NP-complete mutual-visibility (MV) problem currently lacks empirical analysis on its practical behaviour despite theoretical studies. This paper addresses this gap by implementing and evaluating three distinct algorithms - a direct greedy heuristic, a hypergraph-based approximation, and a genetic algorithm - on diverse synthetic graph datasets, including those with analytically known $μ(G)$ values and general graph models. Our results demonstrate that for smaller graphs, the algorithms con…

Triangle-free subsets of the Hypercube
Padmini Mukkamala
https://arxiv.org/abs/2506.18782 https://arxiv.org/pdf/2506.18782

Triangle-free subsets of the Hypercube
We study the problem of determining the largest subset of vertices of the $n$ dimensional hypercube without three vertices at a Hamming distance of exactly $r$ from each other. In particular, we provide a lower bound of $\frac{c2^n}{e^r2^{\frac r2} (\frac nr)^{\frac{3r}{4}}}$ and an upper bound of $O(\frac{r2^n}{n+1})$ when $2r \le n$. In particular, when $r$ is a constant, the lower bound is $\frac{c2^n}{n^{3r/4}}$, while the upper bound is $\frac{c'2^n}{n}$.

Are Large Language Models Capable of Deep Relational Reasoning? Insights from DeepSeek-R1 and Benchmark Comparisons
Chi Chiu So, Yueyue Sun, Jun-Min Wang, Siu Pang Yung, Anthony Wai Keung Loh, Chun Pong Chau
https://arxiv.org/abs/2506.23128

Are Large Language Models Capable of Deep Relational Reasoning? Insights from DeepSeek-R1 and Benchmark Comparisons
How far are Large Language Models (LLMs) in performing deep relational reasoning? In this paper, we evaluate and compare the reasoning capabilities of three cutting-edge LLMs, namely, DeepSeek-R1, DeepSeek-V3 and GPT-4o, through a suite of carefully designed benchmark tasks in family tree and general graph reasoning. Our experiments reveal that DeepSeek-R1 consistently achieves the highest F1-scores across multiple tasks and problem sizes, demonstrating strong aptitude in logical deduction and …

Distinguishing Filling Invariants Associated to Conjugacy in Groups
Conan Gillis, Timothy Riley
https://arxiv.org/abs/2506.19264 https://

Distinguishing Filling Invariants Associated to Conjugacy in Groups
Brick and Corson introduced annular Dehn functions in 1998 to quantify the conjugacy problem for finitely generated groups and gave the fundamental relationships between it, the Dehn function, and the conjugator length function. We furnish the theory with diverse examples groups. In particular, we show that these three invariants are independent -- no two of the three functions determine the other.

Three-point functions from integrability in $\mathcal{N}=2$ orbifold theories
Dennis le Plat, Torben Skrzypek
https://arxiv.org/abs/2506.21323 https://

Three-point functions from integrability in $\mathcal{N}=2$ orbifold theories
Besides solving the spectral problem of $\mathcal{N}=4$ Super-Yang-Mills (SYM) theory, integrability also provides us with tools to compute the structure constants of the theory, most prominently through the hexagon formalism. We show that, with minor modifications, this formalism can also be applied to orbifolds of $\mathcal{N}=4$ SYM theory, which are integrable theories in their own right. To substantiate this claim, we test our results against a direct gauge-theory calculation at tree-level…

Inverse Microparticle Design for Enhanced Optical Trapping and Detection Efficiency in All Six Degrees of Freedom
Moosung Lee, Benjamin A. Stickler, Thomas Pertsch, Sungkun Hong
https://arxiv.org/abs/2506.01837

Inverse Microparticle Design for Enhanced Optical Trapping and Detection Efficiency in All Six Degrees of Freedom
Achieving quantum-limited motional control of optically trapped particles beyond the sub-micrometer scale is an outstanding problem in levitated optomechanics. A key obstacle is solving the light scattering problem and identifying particle geometries that allow stable trapping and efficient motional detection of their center of mass and rotational motion in three dimensions. Here, we present a computational framework that combines an efficient electromagnetic scattering solver with the adjoint …

Drove through the Blackwall Tunnel to Greenwich and back to Islington yesterday.
South of the river it's all 30MPH speed limits and everything feels too fast and scary compared to the sedate and pedestrian-friendly 20MPH limits in the north.
Since I last went through it, it seems the Blackwall tunnel has added a toll.
The TFL website for setting up to pay the tolls is absolutely awful. Failed in Librewolf, Failed in Firefox. Failed because VPN. Took me four attempts in three different browsers to get it to take payment card details.
Demands *no* special characters in the password?!? And doesn't even tell you what the specific problem with the password is, just "doesn't meet the rules above"
Uses awful validation questions like "mothers maiden name". Bad enough practice to use them at all, but the "memorable date" question restricts to ddmmyy format so you can't even put in a date from outside this century.
For some reason asks for a PIN and and Password both!? Pointless. Then actually refuses the login form if you supply both!?

Setting up the auto-payment doesn't seem to have covered the charges added to the registration plate yesterday, so had to do the payment-details entering yet again to deal with yesterday's charges.
Email validation message contains the link only in the HTML of the email, not the text version, so viewed in Mutt it has no link.
And this all seems to be separate from the Dartford Crossing charge, which had a less crappy but still pretty crappy signup.
Good god council programmers suck at web-dev.
#driving #london #tfl #blackwallTunnel #greenwich

Advanced cervical cancer classification: enhancing pap smear images with hybrid PMD Filter-CLAHE
Ach Khozaimi, Isnani Darti, Syaiful Anam, Wuryansari Muharini Kusumawinahyu
https://arxiv.org/abs/2506.15489

Advanced cervical cancer classification: enhancing pap smear images with hybrid PMD Filter-CLAHE
Cervical cancer remains a significant health problem, especially in developing countries. Early detection is critical for effective treatment. Convolutional neural networks (CNN) have shown promise in automated cervical cancer screening, but their performance depends on Pap smear image quality. This study investigates the impact of various image preprocessing techniques on CNN performance for cervical cancer classification using the SIPaKMeD dataset. Three preprocessing techniques were evaluate…

Finite energy foliations in the restricted three-body problem
Lei Liu, Pedro A. S. Salom\~ao
https://arxiv.org/abs/2506.17867 https://

Finite energy foliations in the restricted three-body problem
This paper is about using pseudo-holomorphic curves to study the circular planar restricted three-body problem. The main result states that for mass ratios sufficiently close to $\frac{1}{2}$ and energies slightly above the first Lagrange value, the flow on the regularized component $\mathbb R P^3 \# \mathbb R P^3$ of the energy surface admits a finite energy foliation with three binding orbits, namely two retrograde orbits around the primaries and the Lyapunov orbit in the neck region about th…

Poincar\'e on Gibbs and on Probability in Statistical Mechanics
Bruce D. Popp
https://arxiv.org/abs/2505.12168 https://arxiv.org/…

Poincaré on Gibbs and on Probability in Statistical Mechanics
This paper reviews a paper from 1906 by J. Henri Poincaré on statistical mechanics with a background in his earlier work and notable connections to J. Willard Gibbs. Poincaré's paper presents important ideas that are still relevant for understanding the need for probability in statistical mechanics. Poincaré understands the foundations of statistical mechanics as a many-body problem in analytical mechanics (reflecting his 1890 monograph on The Three-Body Problem and the Equations of Dynamics…

Persistent Homology of Music Network with Three Different Distances
Eunwoo Heo, Byeongchan Choi, Myung ock Kim, Mai Lan Tran, Jae-Hun Jung
https://arxiv.org/abs/2506.13595

Persistent Homology of Music Network with Three Different Distances
Persistent homology has been widely used to discover hidden topological structures in data across various applications, including music data. To apply persistent homology, a distance or metric must be defined between points in a point cloud or between nodes in a graph network. These definitions are not unique and depend on the specific objectives of a given problem. In other words, selecting different metric definitions allows for multiple topological inferences. In this work, we focus on apply…

Optimal Incentive for Regulated Production
Benhao Du, Thomas Treillard, Francois Wang
https://arxiv.org/abs/2506.14286 https://arxiv.…

Optimal Incentive for Regulated Production
This paper explores stochastic control models in the context of decarbonization within the energy market. We study three progressively complex scenarios: (1) a single firm operating with two technologies-one polluting and one clean,(2)two firms model and (3) two firms without any regulatory incentive. For each setting, we formulate the corresponding stochastic control problem and characterize the firms' optimal strategies in terms of investment and production. The analysis highlights the strate…

Pinching-Antenna Systems (PASS) Meet Multiple Access: NOMA or OMA?
Qiao Ren, Xidong Mu, Siyu Lin, Yuanwei Liu
https://arxiv.org/abs/2506.13490 https://

Pinching-Antenna Systems (PASS) Meet Multiple Access: NOMA or OMA?
A fundamental two-user PASS-based communication system is considered under three MA schemes, namely non-orthogonal multiple access (NOMA), frequency division multiple access (FDMA), and time division multiple access (TDMA). For each MA scheme, a pinching beamforming optimization problem is formulated to minimize the required transmit power for satisfying users' rate requirements. For NOMA and FDMA, a two-stage algorithm is proposed, where the locations of PAs are derived sequentially by using t…

Wild refitting for black box prediction
Martin J. Wainwright
https://arxiv.org/abs/2506.21460 https://arxiv.org/pdf/2506.21460…

Wild refitting for black box prediction
We describe and analyze a computionally efficient refitting procedure for computing high-probability upper bounds on the instance-wise mean-squared prediction error of penalized nonparametric estimates based on least-squares minimization. Requiring only a single dataset and black box access to the prediction method, it consists of three steps: computing suitable residuals, symmetrizing and scaling them with a pre-factor $ρ$, and using them to define and solve a modified prediction problem rece…

A predictor-corrector scheme for approximating signed distances using finite element methods
Amina El Bachari, Johann Rannou, Vladislav A. Yastrebov, Pierre Kerfriden, Susanne Claus
https://arxiv.org/abs/2506.17830

A predictor-corrector scheme for approximating signed distances using finite element methods
In this article, we introduce a finite element method designed for the robust computation of approximate signed distance functions to arbitrary boundaries in two and three dimensions. Our method employs a novel prediction-correction approach, involving first the solution of a linear diffusion-based prediction problem, followed by a nonlinear minimization-based correction problem associated with the Eikonal equation. The prediction step efficiently generates a suitable initial guess, significant…

Locating Extremal Periodic Orbits for the Planar Circular Restricted Three Body Problem using Polynomial Sum-of-Squares Optimization
Vinay Sharma, Sergei I Chernyshenko
https://arxiv.org/abs/2505.23430

Locating Extremal Periodic Orbits for the Planar Circular Restricted Three Body Problem using Polynomial Sum-of-Squares Optimization
With an increasing interest in the design of long and complex space missions, the search for orbits that require the least amount of fuel is of fundamental interest. This paper develops existing computational models for locating Unstable Periodic Orbits (UPOs) in polynomial dynamical systems using Sum-of-Squares (SOS) optimization technique and proposes a numerical framework to converge UPOs for the Planar Circular Restricted Three-Body Problem (PCR3BP) in astrodynamics. This is done by develop…

Full non-LTE multi-level radiative transfer I. An atom with three bound infinitely sharp levels
Tristan Lagache, Fr\'ed\'eric Paletou, Malali Sampoorna
https://arxiv.org/abs/2506.15361

Full non-LTE multi-level radiative transfer I. An atom with three bound infinitely sharp levels
The standard nonlocal thermodynamic equilibrium (non-LTE) multi-level radiative transfer problem only takes into account the deviation of the radiation field and atomic populations from their equilibrium distribution. We aim to show how to solve for the full non-LTE (FNLTE) multi-level radiative transfer problem, also accounting for deviation of the velocity distribution of the massive particles from Maxwellian. We considered, as a first step, a three-level atom with zero natural broadening. In…

Low-order finite element complex with application to a fourth-order elliptic singular perturbation problem
Xuewei Cui, Xuehai Huang
https://arxiv.org/abs/2506.20240

Low-order finite element complex with application to a fourth-order elliptic singular perturbation problem
A low-order nonconforming finite element discretization of a smooth de Rham complex starting from the $H^2$ space in three dimensions is proposed, involving an $H^2$-nonconforming finite element space, a new tangentially continuous $H^1$-nonconforming vector-valued finite element space, the lowest-order Raviart-Thomas space, and piecewise constant functions. While nonconforming for the smooth complex, the discretization conforms to the classical de Rham complex. It is applied to develop a decou…

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
Zhidong Zhang
https://arxiv.org/abs/2505.18460 https://

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem
The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness. For instance, the Boolean satisfiability (K-SAT) problems are nontrivial, due to the existence of non-planarity graphs, nonlocalities, and the randomness. In this work, the relation between a spin-glass three-dimensional (3D) Ising model with the lattice size N = mnl and the K-SAT problems…

Partially rigid motions in the planar three-body problem
Richard Moeckel
https://arxiv.org/abs/2506.13570 https://arxiv.org/pdf/2506.…

Partially rigid motions in the planar three-body problem
A solution of the n-body problem in R^d is a relative equilibrium if all of the mutual distance between the bodies are constant. In other words, the bodies undergo a rigid motion. Here we investigate the possibility of partially rigid motions, where some but not all of the distances are constant. For the planar three-body problem with equal masses, we show that partially rigid motions are impossible -- if even one of the three mutual distances is constant, the motion must be a relative equilibr…

Robotic Manipulation of a Rotating Chain with Bottom End Fixed
Qi Jing Chen, Shilin Shan, Quang-Cuong Pham
https://arxiv.org/abs/2506.18355 https://…

Robotic Manipulation of a Rotating Chain with Bottom End Fixed
This paper studies the problem of using a robot arm to manipulate a uniformly rotating chain with its bottom end fixed. Existing studies have investigated ideal rotational shapes for practical applications, yet they do not discuss how these shapes can be consistently achieved through manipulation planning. Our work presents a manipulation strategy for stable and consistent shape transitions. We find that the configuration space of such a chain is homeomorphic to a three-dimensional cube. Using …

Mixing of Gaussian Solute Plumes
Daniel Lester
https://arxiv.org/abs/2506.20387 https://arxiv.org/pdf/2506.20387

Mixing of Gaussian Solute Plumes
We consider the general problem of mixing of Gaussian solute plumes arising across a range of different flows ranging from two-dimensional (2D) to three-dimensional (3D), steady to unsteady, regular to chaotic, Stokes to turbulent. We consider a a range of infinitesimal injection protocols (point or line sources, continuous or pulsed) which generate solute points, lines and sheets and their finite-sized counterparts (blobs, tubes and slabs). We show that evolution of this broad family of Gaussi…

An explicit computational approach for a three-dimensional system of nonlinear elastodynamic sine-Gordon problem
Eric Ngondiep
https://arxiv.org/abs/2506.14807

An explicit computational approach for a three-dimensional system of nonlinear elastodynamic sine-Gordon problem
This paper proposes an explicit computational method for solving a three-dimensional system of nonlinear elastodynamic sine-Gordon equations subject to appropriate initial and boundary conditions. The time derivative is approximated by interpolation technique whereas the finite element approach is used to approximate the space derivatives. The developed numerical scheme is so-called, high-order explicit computational technique. The new algorithm efficiently treats the time derivative term and p…

Two Tiling is Undecidable
Jack Stade
https://arxiv.org/abs/2506.11628 https://arxiv.org/pdf/2506.11628…

Two Tiling is Undecidable
We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed undecidability for three tiles. Along the way, we show that tiling with one prototile is undecidable if there can be edge-to-edge matching rules. This is the first result to show undecidability for monotiling with only local matching constraints.