Results 41 to 50 of about 11,941,652 (143)
Abelian number fields with frobenian conditions
Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
Density of zeros for systems of forms
Abstract Let K$K$ be a field of characteristic zero over which every diagonal form in sufficiently many variables admits a nontrivial zero. For example, K$K$ may be a totally imaginary number field or a finite extension of Qp$\mathbb {Q}_p$. Suppose f1,…,fs$f_1,\ldots,f_s$ are a collection of forms (i.e.
Amichai Lampert
wiley +1 more source
Conditional Randomization Tests for the Specification of Interference Structure
ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley +1 more source
Surjectivity of isometries between weighted spaces of holomorphic functions
We examine the surjectivity of isometries between weighted spaces of holomorphic functions. We show that for certain classical weights on the open unit disc all isometries of the weighted space of holomorphic functions,Hvo(Δ), are surjective.
Rueda, Pilar, Boyd, Christopher
core +1 more source
Reversibility and surjectivity problems of cellular automata [PDF]
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its global transition function is injective) is called the reversibility problem of CA.
Kari, Jarkko
core +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Proceedings of Formal Methods in Computer-Aided Design, FMCAD 2023
The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system in academia and industry for presenting and discussing groundbreaking methods, technologies,
Formal Methods in Computer Aided Design
core +1 more source
Equidistribution in 2‐nilpotent Polish groups and triple restricted sumsets
Abstract The aim of this paper is to establish a Ratner‐type equidistribution theorem for orbits on homogeneous spaces associated with 2$\hskip.001pt 2$‐nilpotent locally compact Polish groups under the action of a countable discrete abelian group.
Ethan Ackelsberg, Asgar Jamneshan
wiley +1 more source
L∞$L^\infty$ compactness of solutions of quasilinear problems and applications
Abstract For a (not necessarily smooth) bounded domain Ω$\Omega$ of RN$\mathbb {R}^N$, N⩾2$N \geqslant 2$ and a Carathéodory vector‐valued function a:Ω×RN→RN$a:\Omega \times \mathbb {R}^N \rightarrow \mathbb {R}^N$, we study the compactness of the inverse of the Leray–Lions operator A(u)=−div(a(x,∇u))$A(u)=-\text{div}(a(x, \nabla u))$, u∈W01,p(Ω)$u\in ...
D. Arcoya +2 more
wiley +1 more source

