Results 191 to 200 of about 9,658 (272)

A new method for a priori practical identifiability. [PDF]

PLoS One
Thompson P, Andersson BJ, Sundqvist N, Cedersund G.   +3 more
europepmc   +1 more source

Robust Tests of Forecast Accuracy for Factor‐Augmented Regressions With an Application to the Novel EA‐MD‐QD Dataset

Journal of Applied Econometrics, EarlyView.
ABSTRACT We present four novel tests of equal predictive accuracy and encompassing á Pitarakis (2023, 2025) for factor‐augmented regressions. Factors are estimated using cross‐section averages (CAs) of grouped series and our theoretical findings are empirically relevant: asymptotic normality, robustness to an overspecification of the number of factors,
Alessandro Morico, Ovidijus Stauskas
wiley   +1 more source

On the Optimal File Size of Capacity-Achieving Byzantine-Resistant Private Information Retrieval Schemes. [PDF]

Entropy (Basel)
Kruglik S, Kiah HM, Dau SH, Wang H.
europepmc   +1 more source

A Generalization of Post-Widder Operators Based on q-Integers

Annals of the Alexandru Ioan Cuza University - Mathematics, 2014
Didem Aydin, Ali Aral, Gülen Başcanbaz-Tunca   +2 more
openaire   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$

Journal of Combinatorial Designs, EarlyView.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

Some new QEC MDS codes with large minimum distance. [PDF]

Sci Rep
Li L, Tian F, Cao Z, Liu L.
europepmc   +1 more source

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley   +1 more source

Irrationality and transcendence questions in the 'poor man's adèle ring'. [PDF]

Ramanujan J
Luca F, Zudilin W.
europepmc   +1 more source

Improved Centile Estimation by Transformation And/Or Adaptive Smoothing of the Explanatory Variable. [PDF]

Stat Med
Rigby RA, Stasinopoulos DM, Cole TJ.
europepmc   +1 more source

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák, Félix Moreno Peñarrubia   +1 more
wiley   +1 more source