Results 61 to 70 of about 3,984 (166)
Tensor valuations on lattice polytopes
The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with respect to the
Ludwig, Monika, Silverstein, Laura
core +1 more source
On Lev's periodicity conjecture
Abstract We classify the sum‐free subsets of F3n${\mathbb {F}}_3^n$ whose density exceeds 16$\frac{1}{6}$. This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum‐free subset A⊆F3n${A\subseteq {\mathbb {F}}_3^n}$ is maximal with respect to inclusion and aperiodic (in the sense that there is no non‐zero vector v$v$
Christian Reiher
wiley +1 more source
Generating Medical Reports With a Novel Deep Learning Architecture
ABSTRACT The writing of medical reports by doctors in hospitals is a critical and sensitive process that is time‐consuming, prone to human error, and requires medical experts on site. Existing work on autonomous medical report generation using medical images as input has not achieved sufficiently high success. The goal of this paper is to present a new,
Murat Ucan, Buket Kaya, Mehmet Kaya
wiley +1 more source
Abstract We prove that at differentiability points r0>0$r_0>0$ of the volume function of a compact set A⊂Rd$A\subset \mathbb {R}^d$ (associating to r$r$ the volume of the r$r$‐parallel set of A$A$), the surface area measures of r$r$‐parallel sets of A$A$ converge weakly to the surface area measure of the r0$r_0$‐parallel set as r→r0$r\rightarrow r_0 ...
Jan Rataj, Steffen Winter
wiley +1 more source
On the Chromatic Thresholds of Hypergraphs
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minimum degree at least $c \binom{|V(H)|}{r-1}$ has bounded chromatic number ...
DHRUV MUBAYI +6 more
core +1 more source
The Kneser property of the weak solutions of the three dimensional Navier-Stokes equations
The Kneser theorem for ordinary differential equations without uniqueness says that the attainability set is compact and connected at each instant of time. We establish corresponding results for the attainability set of weak solutions for the 3D Navier-Stokes equations satisfying an energy inequality.
Peter E. Kloeden, José Valero
openaire +1 more source
Bayesian reordering model with feature selection
In phrase-based statistical machine translation systems, variation in grammatical structures between source and target languages can cause large movements of phrases.
Alrajeh, Abdullah, Niranjan, Mahesan
core +1 more source
A Sharp Threshold for a Random Version of Sperner's Theorem
ABSTRACT The Boolean lattice 𝒫(n) consists of all subsets of [n]={1,…,n}$$ \left[n\right]=\left\{1,\dots, n\right\} $$ partially ordered under the containment relation. Sperner's Theorem states that the largest antichain of the Boolean lattice is given by a middle layer: the collection of all sets of size n/2$$ \left\lfloor n/2\right\rfloor $$, or also,
József Balogh, Robert A. Krueger
wiley +1 more source
There is no 290‐Theorem for higher degree forms
Abstract We study the universality of forms of degrees greater than 2 over rings of integers of totally real number fields. We show that such universal forms always exist, but cannot be characterized by any variant of the 290‐Theorem of Bhargava–Hanke.
Vítězslav Kala, Om Prakash
wiley +1 more source
Quantitative estimates on Jacobians for hybrid inverse problems
We consider $\sigma$-harmonic mappings, that is mappings $U$ whose components $u_i$ solve a divergence structure elliptic equation ${\rm div} (\sigma \nabla u_i)=0$, for $i=1,\ldots,n $.
Alessandrini, Giovanni, Nesi, Vincenzo
core +1 more source

