Cohomology of parallelized n-manifolds carries a natural homotopy involutive n-Frobenius structure extending the rational homotopy type, via Quillen equivalence to n-Poisson cooperad comodules.
Canonical reference
Title resolution pending
Canonical reference. 79% of citing Pith papers cite this work as background.
259
Pith papers citing it
Background
79% of classified citations
citation-role summary
background 50
method 5
other 2
citation-polarity summary
claims ledger
- background for gravitating objects. For comprehensive reviews of effective field theory in a variety of physical contexts relevant to the current problem, see the recent textbook by Burgess [110], as well as the review articles by Pich [111], Donoghue [112, 113], Kaplan [114], Rothstein [115-117], Burgess [118], Goldberger [119-121], Porto [122], Manohar [123], Levi [124], and Penco [125]. A note on language: The EFT approach was pioneered in particle physics. In particle physics the expansion parameter is
- background r= 3r s/2−ϵwithϵgoing quickly to zero with increasingℓ, as we see from only the first two modes. 3.2. Kerr 3.2.1. Geometry Black holes in the real world rotate, which is not accounted for in the spherically-symmetric Schwarzschild solution (3.1). Schwarzschild had derived his metric within months of the publication of Einstein's field equations, while it took nearly a half century for Kerr to find its spinning generalization [235]. Here we will summarize salient features of the Kerr solution; se
- background Importantly, the sum of all angular momenta,ℓ1 +ℓ2 +ℓ3 +···, must be even. Starting fromO(E4), however, for a fixed set of angular momenta(ℓ1ℓ2···ℓn+1), multiple independent coefficients may arise. The precise counting of inequivalent contractions and independent Wilson coefficients follows from standard group-theoretic arguments, see e.g., Refs. [183, 189, 190]. 2.3. Examples of EFT calculations and matching The effective field theory(2.9) is completely general and, as long as one is concerned
- method and all upper bounds at the 95 % CL. The e ffectiveχ2 value of model n is given relative to model n− 1. Parameters Prior type Prior range N Discrete uniform [0 , 8] ln V∗ Uniform [ −25,−15] d ln V∗/dφ Log-uniform [10 −3, 10−0.3] d2ln V1/dφ2,..., d2ln VN/dφ2 Uniform [ −0.5, 0.5] φ1,...,φ N Sorted uniform [ ˜φmin, ˜φmax ] ln 1010PR(k) Indirect constraint [2 , 4] Table 9. Parameters of the free-form potential reconstruction analysis and details of the priors. There is a further prior con- straint in
authors
co-cited works
representative citing papers
Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
A Master Theorem supplies explicit formulas for topological zeta functions of matroids and solves multiple conjectures.
A threshold κ=Θ(1/√α) (α=m/n) separates easy collision finding from OGP-based exponential lower bounds against online algorithms in single-layer binary NNs.
PAL uses the classical Preisach hysteresis operator with learned thresholds and an extrema stack to model sequences, proving O(1)-depth Turing completeness via two-stack PDA simulation and incomparability with standard transformers on rate-independent vs. random-access functions.
Categorical univalence of a universe does not entail function extensionality, as shown by polynomial models of type theory that refute the latter while satisfying the former.
Vitriflow is a new explicit calibration framework for melt-quench MD that produces statistically converged, screened amorphous ensembles demonstrated on a-SiO2, a-Si3N4 and a-Sm2O3.
Introduces separable and essentially separable graphs as a broad class for mixed graphical models, provides multiple characterizations of the graphs and their separation equivalence, and develops an identification algorithm for equivalence classes.
In the subcritical regime m = m_c(1-ε) with ε→0 and ε³n→∞, the largest component L1 satisfies L1 = (1+o_p(1)) * [2(α+2)/(α+1)] ε^{-2} log(ε³ n) for fixed α>0 (and analogous limits when α(n)→a).
Classifies finite-field Clifford dual-unitary gates into q-2 perfect-tensor cores and others, deriving exact masking distances d1(t)=4t and d2(t)=4t-2 for perfect-tensor circuits.
Sound and complete axiomatizations are provided for path-reachability logic with Cantor derivative in T1 topologies and metric spaces, with decidability via neighborhood semantics that yields the finite model property.
Introduces direct belief contraction on unconstrained Kripke models in DEL, shows it satisfies some but not all contraction properties, and gives sound complete axiomatizations for the logic and its extension to private announcements.
Quantum corrections suppress the symmetron fifth force by order 10% within a Compton wavelength of a thick planar source and enhance it at larger distances.
Unifilarisation of stochastic Mealy machines is an instance of coalgebraic determinisation over monads with support structure, producing causal stochastic behaviours rather than Moore-style output distributions.
Mazur and Jester manifolds have pairwise nonhomeomorphic boundaries via an octahedral hyperbolic structure, Dehn filling, and systolic geodesics, distinguishing their contractible 4-manifolds.
Seiberg-Witten instanton expansions combined with exact WKB period integrals allow analytic computation and continuation of quasinormal modes from large q to q=0.
An active learning method based on E-SINDy identifies governing ODEs and PDEs accurately with significantly fewer data samples than random sampling across tested systems.
Effective scalaron-photon coupling in f(R) gravity vanishes in the light-scalaron limit due to cancellation of anomaly-induced and diagrammatic contributions.
Provides algorithms and complexity results for the δ-Dispersion and δ-Covering problems on bounded-treewidth graphs for integer, rational, and irrational distances.
Diagonal EP under variance-profile Gaussian matrices produces Gaussian-process dynamics with profile-dependent memory instead of conventional scalar state evolution.
LSD extends speculative sampling to second-order Langevin dynamics, achieving 3-9x speedup in MD while exactly sampling from the target distribution without relative error.
Introduces Δ-VFE pivoted Cholesky, a pivot rule maximizing the one-step gain in a VFE functional for kernel matrices via closed-form decomposition and batch sampling, yielding improved GP objective values and accuracy at low ranks.
DAML is a new dynamic modal logic that derives conditional obligations in multi-agent settings by combining action models with deontic value maximization over outcomes.
Training-language dominance, not English inherent properties, determines brain-LLM alignment across English, Chinese, and French, with additional independent effects from typological distance concentrated in syntactic brain regions.
citing papers explorer
-
Brain-LLM Alignment Tracks Training Data, Not Typology
Training-language dominance, not English inherent properties, determines brain-LLM alignment across English, Chinese, and French, with additional independent effects from typological distance concentrated in syntactic brain regions.
-
When transformers learn "impossible" languages, what do they learn?
Transformers on impossible-language variants show gradual grammatical sensitivity loss but sharp long-sentence generation failures, supporting generative deficiency as a link to non-attestation.
-
ToxiREX: A Dataset on Toxic REasoning in ConteXt
ToxiREX is a new dataset of 128k Reddit comments in six languages with hierarchical annotations for implicit toxicity in conversational context based on an existing reasoning schema.
-
Syntactic Belief Update as the Driver of Garden Path Processing Difficulty
Syntactic belief update via generalized Rényi divergence on syntactic trees predicts garden path reading times better than lexical surprisal.
-
Introducing multiplex semantic networks as multifaceted representations of creative associative knowledge across multilingual samples
Multiplex semantic networks assembled from verbal fluency, free association, sentence-chain and narrative tasks capture non-redundant aspects of semantic organization and improve ridge-regression prediction of individual creativity scores by 50 percent when layers are combined.
-
Talking to a Know-It-All GPT or a Second-Guesser Claude? How Repair reveals unreliable Multi-Turn Behavior in LLMs
Each tested LLM shows its own characteristic unreliability when engaging in repair during extended math-question dialogues.
-
"I understand your perspective": LLM Persuasion and Sycophancy through the Lens of Communicative Action Theory
LLMs outperform humans in expressing illocutionary intents and sycophancy in successful persuasive counter-arguments from ChangeMyView, with crowd workers preferring LLM versions.
-
Grounding Text Embeddings in Stakeholder Associations
The Stakeholder Grounding Exercise shows neural text embeddings are 19-26pp less reliable than human experts at capturing semantic distinctions, with misalignment strongly correlated to poorer clustering performance (ρ=0.9), replicated across Danish policy and US AI domains.