Results 61 to 70 of about 562 (207)

Shuffle algebra and polylogarithms

open access: yesDiscrete Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincel Hoang Ngoc Minh   +2 more
openaire   +1 more source

Descent for l-Adic Polylogarithms [PDF]

open access: yesNagoya Mathematical Journal, 2008
AbstractLet L be a finite Galois extension of a number field K. Let G:= Gal(L/K). Let z1,…, zN ∊ L* \ {1} and let m1 …, mN ∊ ℚl. Let us assume that the linear combination of l-adic polylogarithms (constructed in some given way) is a cocycle on GL and that the formal sum is G-invariant. Then we show that cn determines a unique cocycle sn on GK.
Douai, Jean-Claude   +1 more
openaire   +4 more sources

Emergent Topological Magnons and Thermal Hall Effect in 2D Filling‐Enforced Fully Compensated Ferrimagnets

open access: yesAdvanced Functional Materials, Volume 36, Issue 52, 29 June 2026.
Schematic illustration of ferroelectric‐intercalation‐driven transitions in magnetic configurations and magnonic topological phases, together with the symmetry relations of magnonic Berry curvature. ABSTRACT Magnons in collinear magnets with vanishing net magnetization offer unique advantages for spin transport, including ultrafast dynamics and ...
Yingxi Bai   +8 more
wiley   +1 more source

Holographic correlators with multi-particle states

open access: yesJournal of High Energy Physics, 2021
We derive the connected tree-level part of 4-point holographic correlators in AdS3 × S 3 × M $$ \mathcal{M} $$ (where M $$ \mathcal{M} $$ is T 4 or K3) involving two multi-trace and two single-trace operators.
Nejc Čeplak   +3 more
doaj   +1 more source

Stacking‐Engineered Magnonic Topology and Transport in Honeycomb Homobilayers

open access: yesAdvanced Functional Materials, Volume 36, Issue 39, 14 May 2026.
ABSTRACT Topological magnons have emerged as a promising platform for dissipationless bosonic transport. However, a straightforward and effective strategy to engineer such topological states in real materials has yet to be fully realized. Here, a general scheme for controlling magnonic topological states via stacking engineering in van der Waals ...
Xiaoran Feng   +6 more
wiley   +1 more source

Integration in terms of polylogarithm

open access: yesCoRR, 2018
This paper provides a Liouville principle for integration in terms of dilogarithm and partial result for polylogarithm.
openaire   +3 more sources

Finite‐Horizon Behavior of the Periodically Observed Time‐Homogeneous Poisson Process

open access: yesNaval Research Logistics (NRL), Volume 72, Issue 8, Page 1157-1169, December 2025.
ABSTRACT When evaluating whether system arrivals can be characterized as a Poisson process, researchers draw conclusions from observed data. In practice, many systems are observed periodically (e.g., hourly, daily, monthly), which leads to discretization errors in the observed data.
Zachary T. Hornberger   +2 more
wiley   +1 more source

Remarks on an Identity of Anastase and Díaz-Barrero

open access: yesAxioms
We extend an algebraic identity of Anastase and Díaz-Barrero (2022) and apply our results to deduce various formulas for sums and series involving (among others) Fibonacci and Lucas numbers, Bernoulli polynomials, and the Riemann zeta function.
Horst Alzer, Robert Frontczak
doaj   +1 more source

Some identities and reciprocity relationsof unipoly-Dedekind type DC sums

open access: yesJournal of Inequalities and Applications, 2021
Dedekind type DC sums and their generalizations are defined in terms of Euler functions and their generalization. Recently, Ma et al. (Adv. Differ. Equ. 2021:30 2021) introduced the poly-Dedekind type DC sums by replacing the Euler function appearing in ...
Hye Kyung Kim, Dae Sik Lee
doaj   +1 more source

Determination of the Optimal Window Size for the Spatial XOR Filter

open access: yesSoftware: Practice and Experience, Volume 55, Issue 11, Page 1773-1784, November 2025.
ABSTRACT Introduction An XOR filter is a probabilistic data structure representing a set of keys for membership queries. Given a set X⊂𝒰 of n$$ n $$ keys, and hash functions h1,…,hk:𝒰→{1,…,m}, the filter relies on filling in an array H[1,…,m]$$ H\left[1,\dots, m\right] $$ such that, for all x∈X$$ x\in X $$, h1(x)⊕⋯⊕hk(x)$$ {h}_1(x)\oplus \cdots \oplus {
Paulo Diogo Rodrigues Leão   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy