g(x)/g(x)$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Tricriticality and chaos in a generalized Allee-logistic map
arXiv:2606.05351v1 Announce Type: cross Abstract: We present a novel nonlinear dynamical model, the generalized Allee-logistic (GAL) map given by $x_{t+1} = r x_t (1 - x_t) G(x_t)$ where $G(x_t) = m (x_t - h) + 1 - m$ incorporates the Allee effect with magnitude $m$ and threshold $h$. The case $m = 0$ yields the logistic map with a continuous transition to extinction. Conversely, $m = 1$ recovers a previously studied model that undergoes only a discontinuous extinction-to-active transition....
Ordinals and recursively defined functions on the reals
arXiv:2311.17210v5 Announce Type: replace-cross Abstract: We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function $f:\mathbb R\to\mathbb R$, call a decreasing sequence $x_1>x_2>x_3>\cdots$ "$f$-bad" if $f(x_1)>f(x_2)>f(x_3)>\cdots$, and call the function $f$ "ordinal decreasing" if there exist no infinite $f$-bad sequences. We prove the following result:
A Kronecker algorithm for locally closed sets over a perfect field
arXiv:2512.14888v2 Announce Type: replace-cross Abstract: We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the set of common zeros $\{F_1=0,\ldots,F_r=0,G\not=0\}$ of multivariate polynomials $F_1,\ldots,F_r\in k[X_1,\ldots,X_n]$ outside a prescribed hypersurface $\{G=0\}$. We assume that $F_1,\ldots,F_r$...
Relaxation Kernel, Spectral Dissipation, and Global Convergence of Blahut--Arimoto Dynamics
arXiv:2604.25106v3 Announce Type: replace Abstract: We develop a spectral theory for continuous- and discrete-time Blahut--Arimoto (BA) dynamics, centered on the relaxation kernel $ \G = \E_p[K^*_X \otimes K^*_X] $. Five main results are established. Along the continuous-time BA flow, the free energy satisfies the exact $ \chi^2 $-dissipation identity $ \dot F_\beta = -\D(q) $, where $ \D(q)=\chi^2(\T q \| q) $ is the Pearson $ \chi^2 $-divergence.
Multilevel randomized quasi-Monte Carlo estimator for nested integration
arXiv:2412.07723v5 Announce Type: replace Abstract: Nested integration problems arise in various scientific and engineering applications, including Bayesian experimental design, financial risk assessment, and uncertainty quantification. These nested integrals take the form $\int f\left(\int g(\boldsymbol{y},\boldsymbol{x})\mathrm{d}\boldsymbol{x}\right)\mathrm{d}\boldsymbol{y}$, for nonlinear $f$, making them computationally challenging, particularly in high-dimensional settings. Although...
A note on rounding fractional matchings with constant-factor strong negative correlation
arXiv:2606.07820v1 Announce Type: new Abstract: We describe new dependent-rounding algorithms for bipartite graphs. Given a fractional matching $x$ of graph $G = (U \cup V, E)$, the algorithms return an integral solution $X$ such that each right-node $v \in V$ has at most one edge, and where the variables $X_e$ also satisfy broad non-positive correlation properties. In particular, for any edges $e_1, e_2$ sharing a left-node $u \in U$, the variables $X_{e_1}, X_{e_2}$ have \emph{strong}...
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
arXiv:2606.01809v1 Announce Type: new Abstract: In the planar, dynamic All-Pairs Shortest Paths (APSP) problem, a planar, weighted digraph $G$ undergoes a sequence of edge weight updates and the goal is to maintain a data structure on $G$, that can quickly answer distance queries between any two vertices $x,y \in V(G)$. The currently best algorithms for this problem require $\tilde{O}(n^{2/3})$ worst-case update and query time, while conditional lower bounds show that either update or query...
The grid-minor theorem revisited
arXiv:2307.02816v2 Announce Type: replace-cross Abstract: We prove that for every planar graph $X$ of treedepth $h$, there exists a positive integer $c$ such that for every $X$-minor-free graph $G$, there exists a graph $H$ of treewidth at most $f(h)$ such that $G$ is isomorphic to a subgraph of $H\boxtimes K_c$. This is a qualitative strengthening of the Grid-Minor Theorem of Robertson and Seymour (JCTB 1986), and treedepth is the optimal parameter in such a result. As an example...
One-Shot Klein Cutting Planes for Lipschitz Geodesically Convex Optimization in Hyperbolic Space
arXiv:2605.17540v4 Announce Type: replace Abstract: Motivated by the COLT 2023 open problem of Criscitiello, Mart\'inez-Rubio, and Boumal on deterministic first-order methods for Lipschitz geodesically convex optimization on Hadamard manifolds, we study hyperbolic space \[ \HH^d_{-\kappaC^2} =\{X\in\R^{d+1}:\ipL{X}{X}=-1,\ X_0>0\}, \qquad \ip{U}{V}_X=\kappaC^{-2}\ipL{U}{V}. For every geodesically convex $M$-Lipschitz function \[ f:\bar B_{\HH}(x_0,r)\to\R,\qquad s=\kappaC r, \] we give a...
Repair Before Veto, When Repair Is Hidden: Quantum-Accessible Features for Repair-Augmented Constraint Learning
Announce Type: cross Abstract: Hard-constraint decision systems usually veto infeasible candidates. This is too rigid when the system can act: if a known affordable repair would make an infeasible candidate feasible and valuable, rejection is a false veto rather than a ranking error. We introduce Q-RACL (Quantum Repair-Augmented Constraint Learning), a repair-before-veto framework that first defines RACL decision semantics and then identifies the single inference link where quantum feature...