Results 71 to 80 of about 2,506 (162)
Inference on Common Trends in a Cointegrated Nonlinear SVAR
ABSTRACT We consider the problem of performing inference on the number of common stochastic trends when data is generated by a cointegrated CKSVAR (a two‐regime, piecewise affine SVAR; Mavroeidis, 2021), using a modified version of the Breitung (2002) multivariate variance ratio test that is robust to the presence of nonlinear cointegration (of a known
James A. Duffy, Xiyu Jiao
wiley +1 more source
ABSTRACT I give an argument for a version of the principle of sufficient reason from several plausible principles about negative facts and sufficient conditions. I then give an argument for a slightly weaker version of the principle without the reference to negative facts.
Stephen Harrop
wiley +1 more source
The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2
Abstract Let q$q$ be a prime power and Fq$\mathbb {F}_q$ the finite field with q$q$ elements. For a positive integer n$n$, the polynomial Xn−1∈Fq[X]$X^n - 1 \in \mathbb {F}_q[X]$ is termed 3‐sparse over Fq$\mathbb {F}_q$ if all its irreducible factors in Fq[X]$\mathbb {F}_q[X]$ are either binomials or trinomials.
Kaimin Cheng
wiley +1 more source
On the additive image of zeroth persistent homology
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Rational points on even‐dimensional Fermat cubics
Abstract We show that even‐dimensional Fermat cubic hypersurfaces are rational over any field of characteristic not equal to three, by constructing explicit rational parameterizations with polynomials of low degree. As a byproduct of our rationality constructions, we obtain estimates for the number of their rational points over a number field and ...
Alex Massarenti
wiley +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) denote the minimum size of a feedback arc set in an oriented multigraph D. In several papers, upper bounds for fas ( D ) were obtained for oriented multigraphs D with maximum degree upper‐bounded by a constant.
Gregory Gutin +3 more
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source

