Tootfinder

Constructing and transforming standard resolutions of local modules
Xingbang Hao
https://arxiv.org/abs/2508.11306 https://arxiv.org/pdf/2508.11306

Constructing and transforming standard resolutions of local modules
We construct standard resolutions for analytic local modules on complex hypersurfaces using standard basis methods, with extensions to complete intersections. The algebraic version over arbitrary infinite fields is also suggested. Applications include derived category formula of local hypersurface blow-ups, revealing new connections between standard bases and categorical geometry.

Adaptive time-domain boundary element methods for the wave equation with Neumann boundary conditions
Alessandra Aimi, Giulia Di Credico, Heiko Gimperlein, Chiara Guardasoni
https://arxiv.org/abs/2508.12332

Adaptive time-domain boundary element methods for the wave equation with Neumann boundary conditions
This article investigates adaptive mesh refinement procedures for the time-domain wave equation with Neumann boundary conditions, formulated as an equivalent hypersingular boundary integral equation. Space-adaptive and time-adaptive versions of a space-time boundary element method are presented, based on a reliable a posteriori error estimate of residual type. Numerical experiments illustrate the performance of the proposed approach.

🇺🇦 #NowPlaying on #BBC6Music's #HuwStephens
Hyper Go Go:
🎵 High
#HyperGoGo
https://djblackwhite.bandcamp.com/album/hyper-go-go-high-3-versions
https://open.spotify.com/track/0Dj2WOoBOmggclIMwl8nOk

On Sidorenko exponents of hypergraphs
Hyunwoo Lee
https://arxiv.org/abs/2509.08680 https://arxiv.org/pdf/2509.08680…

On Sidorenko exponents of hypergraphs
For an $r$-graph $F$, define Sidorenko exponent $s(F)$ as $$s(F):= \sup \{s \geq 0: \exists \text{$r$-graph $H$ s.t. } t_F(H) = t_{K^{(r)}_r} (H)^s > 0\},$$ where $t_{H_1}(H_2)$ denotes the homomorphism density of $H_1$ in $H_2$. The celebrated Sidorenko's conjecture states that $s(F) = e(F)$ holds for every bipartite graph $F$. It is known that for all $r \geq 3$, the $r$-uniform version of Sidorenko's conjecture is false, and only a few hypergraphs are known to be Sidorenko. In this paper, …

Towards small quantum Chern character
Hua-Zhong Ke, Changzheng Li, Jiayu Song
https://arxiv.org/abs/2507.12333 https://arxiv.org/pdf/…

Towards small quantum Chern character
We show a quantum version of Chern character homomorphism from the small quantum K-theory to the small quantum cohomology in the cases of projective spaces and incidence varieties, whose classical limit gives the classical Chern character homomorphism. We also provide a ring presentation of the small quantum K-theory of Milnor hypersurfaces.

I finally figured out why one server had started barfing on 421 (no SNI) when most of the rest are similar and some have more domains and they're all behind haproxy with equivalent backend config.
This server has httpd-2.4.64-1 those that are ok are at httpd-2.4.62-1 with the other version available.
So I guess the others will fall down at the next update.
The fix is to send an explicit sni in the invocation in the particular back end section.
So I suppose I fi…

Replaced article(s) found for math.CT. https://arxiv.org/list/math.CT/new
[1/1]:
- The Category of Hypergroups: seeking for a generalized version of Abelian Categories
Kaique Matias de Andrade Roberto, Ana Luiza Ten\'orio

A Hyperlogic for Strategies in Stochastic Games (Extended Version)
Lina Gerlach (RWTH Aachen University), Christof L\"oding (RWTH Aachen University), Erika \'Abrah\'am (RWTH Aachen University)
https://arxiv.org/abs/2506.16775

A Hyperlogic for Strategies in Stochastic Games (Extended Version)
We propose a probabilistic hyperlogic called HyperSt$^2$ that can express hyperproperties of strategies in turn-based stochastic games. To the best of our knowledge, HyperSt$^2$ is the first hyperlogic for stochastic games. HyperSt$^2$ can relate probabilities of several independent executions of strategies in a stochastic game. For example, in HyperSt$^2$ it is natural to formalize optimality, i.e., to express that some strategy is better than all other strategies, or to express the existence …

On the Jacobian polygon and \L ojasiewicz exponent of isolated complex hypersurface singularities
Baldur Sigur{\dh}sson
https://arxiv.org/abs/2509.06150 https://

On the Jacobian polygon and Łojasiewicz exponent of isolated complex hypersurface singularities
Given a hypersurface singularity $(X,0) \subset (\mathbb{C}^{n+1},0)$ defined by a holomorphic function $f:(\mathbb{C}^{n+1},0) \to (\mathbb{C},0)$, we introduce an alternating version of Teissier's Jacobian Newton polygon, associated with a complex isolated hypersurface singularity, and prove formulas for both these invariants in terms of an embedded resolution of $(X,0)$. The formula for the alternating version has an advantage, in that for Newton nondegenerate functions, it can be calculated…

Hypergraph Tur\'an problem of the generalized triangle with bounded matching number
Jian Wang, Wenbin Wang, Weihua Yang
https://arxiv.org/abs/2507.04579

Hypergraph Turán problem of the generalized triangle with bounded matching number
Let $\mathcal{H}$ be a 3-graph on $n$ vertices. The matching number $ν(\mathcal{H})$ is defined as the maximum number of disjoint edges in $\mathcal{H}$. The generalized triangle $F_5$ is a 3-graph on the vertex set $\{a,b,c,d,e\}$ with the edge set $\{abc, abd,cde\}$. In this paper, we showed that an $F_5$-free 3-graph $\mathcal{H}$ with matching number at most $s$ has at most $s\lfloor (n-s)^2/4\rfloor$ edges for $n\geq 30(s+1)$ and $s\geq 3$. For the proof, we establish a 2-colored version …