Searcharxiv⌕ Search

arXiv subjects

Abhishek Shankar

Publications and source records attributed to Abhishek Shankar.

5 recordsLinked to original sources

Divisor Folding and Finite-Group Trace Obstructions

For a symmetric integer frequency set of size $n$ with Fourier floor $K$, we study a positive trace weighted by the reciprocal of the regularized Fourier multiplier. If restriction to frequencies divisible by $p$ leaves $n/p+O(K^2)$ frequencies, then for $n\ge K^4$ and $p\ll n/K^3$ the original trace differs by $O(n)$ from $p$ times the core trace at the inherited regularization. The transfer reaches cores of size $\asymp K^3$ and preserves vanishing triple density with diverging normalized triple count. We construct exactly regular finite abelian spectra at these scales for which the linear core trace bound fails by a power. The examples use unions of classical semiprimitive cyclotomic classes and also give obstructions in both reflection parities in odd characteristic. Finally, we bound the overlap of lifts of a core by its smallest positive Fourier height and the symmetry of the lifts. These bounds exclude balanced lifts of the binary examples in a range of cyclic extensions and quantify the asymmetry required in odd prime split extensions.

math.NT↗

A Quarter-Power Bound for Chowla's Cosine Problem

For every nonempty finite set $S$ of $N$ positive integers we prove $-\min_{x\in\mathbb{T}}\sum_{s\in S}\cos(2πsx)\gg (N/\log(2N))^{1/4}$. The proof uses a reversible phase kernel whose one-step and two-step laws are close in total variation. Comparison of rows and a height cutoff produce a partition into pieces of bounded mean. A Fourier rounding estimate then forces many additive triples to cross the partition. Two choices of phase density yield bounds in terms of negative mass and an exact conditional-pair defect, respectively. A logarithmic refinement gives a log-free bound at low triple density. At fixed positive triple density the log-free bound is a corollary of known boundary estimates. We give a separate spectral proof using an integer difference count and a theorem of Yip.

math.CA↗

A Log-Free $n^{1/5}$ Bound for Chowla's Cosine Problem

For a finite set $S$ of positive integers, put $K(S):=-\min_{x\in\mathbb T}\sum_{s\in S}\cos(2πsx)$. Bedert recently proved the uniform lower bound $K(S)\geq |S|^{1/5-o(1)}$. We remove the subpolynomial loss and prove that $K(S)\geq c|S|^{1/5}$ for an absolute constant $c>0$. The proof combines two estimates from Bedert's argument with an exact averaging identity for the asymmetric boundaries of additive intersections. This identity replaces the multiplicative-amplification step responsible for the logarithmic loss.

math.CA↗

Dynamical and Optimization Trade-offs of Levi--Civita Coordinates for Learned Close-Encounter Dynamics

Classical regularization removes the binary-collision singularity from the Kepler problem, but its value as a representation for learned Hamiltonian dynamics has not been systematically isolated. We compare Cartesian and planar Levi--Civita formulations of a perturbed Kepler system with a smooth quadrupole potential. With the perturbation supplied analytically, a Levi--Civita Hamiltonian splitting holds the maximum relative energy error near $2.1\times10^{-5}$ through eccentricity $e=0.99$, while the Cartesian splitting becomes unstable. This advantage persists at matched physical horizon and force-evaluation budget, where the regularized baseline is $3\times10^{-5}$, about $4.7$--$8.3$ orders of magnitude below the Cartesian arm depending on eccentricity. In held-out high-eccentricity tests with matched sampling, regularized models produce finite rollouts in $40/40$ runs versus $0/40$ for Cartesian. However, the fixed-shell construction supplies the regularized model with the exact initial orbit energy, and survival still carries $\mathcal{O}(1)$ energy error. Four neural residual objectives fail to approach the analytic result. Exact-feature controls show that the regularized residual is a four-monomial degree-6 polynomial that a direct least-squares solve fits to the baseline. The remaining exact-feature gap is due to severe raw-basis ill-conditioning: orthogonalization restores baseline fitting for L-BFGS in two iterations. Small MLPs remain at $\mathcal{O}(1)$ rollout error even after gauge symmetrization. Levi--Civita coordinates therefore improve dynamical conditioning while worsening raw-basis optimization conditioning; accurate neural residual learning remains unresolved. This is a controlled falsification-plus-trade-off study, not a solution to learned close-encounter dynamics.

physics.comp-ph↗

Autonomous Control of a Novel Closed Chain Five Bar Active Suspension via Deep Reinforcement Learning

Planetary exploration requires traversal in environments with rugged terrains. In addition, Mars rovers and other planetary exploration robots often carry sensitive scientific experiments and components onboard, which must be protected from mechanical harm. This paper deals with an active suspension system focused on chassis stabilisation and an efficient traversal method while encountering unavoidable obstacles. Soft Actor-Critic (SAC) was applied along with Proportional Integral Derivative (PID) control to stabilise the chassis and traverse large obstacles at low speeds. The model uses the rover's distance from surrounding obstacles, the height of the obstacle, and the chassis' orientation to actuate the control links of the suspension accurately. Simulations carried out in the Gazebo environment are used to validate the proposed active system.

cs.RO↗