2,304 results for finite · 0.155s

arxiv.org/abs/2305.03575v1

Pointwise gradient estimate of the ritz projection

Let $Ω\subset \mathbb{R}^n$ be a convex polytope ($n \leq 3$). The Ritz projection is the best approximation, in the $W^{1,2}_0$-norm, to a given function in a finite element space. When such finite element spaces are constructed on the basis of qua...

arxiv.org/abs/2309.08068v1

A Comparison of Two Lattice Boltzmann Models for Electrodynamics

In recent years, various Lattice Boltzmann models for electrodynamics have been developed as alternatives to classical methods such as Finite Difference Time Domain (FDTD) and Finite Element Methods (FEM). However, there has been a lack of systematic...

Sponsored Partners
arxiv.org/abs/1308.0933v1

BRAVO for many-server QED systems with finite buffers

This paper demonstrates the occurrence of the feature called BRAVO (Balancing Reduces Asymptotic Variance of Output) for the departure process of a finite-buffer Markovian many-server system in the QED (Quality and Efficiency-Driven) heavy-traffic re...

arxiv.org/abs/2308.05714v1

Hilbert's tenth problem for lacunary entire functions of finite order

In the context of Hilbert's tenth problem, an outstanding open case is that of complex entire functions in one variable. A negative solution is known for polynomials (by Denef) and for exponential polynomials of finite order (by Chompitaki, Garcia-Fr...

arxiv.org/abs/2602.04468v1

Hilbert's tenth problem for finitely generated rings

This expository article covers the recent developments surrounding Hilbert's tenth problem for finitely generated rings. We start by recounting the history of Hilbert's tenth problem over the integers, which was resolved negatively by Matiyasevich--R...

arxiv.org/abs/1401.1634v1

Random sets of finite perimeter

An approach to modelling random sets with locally finite perimeter as random elements in the corresponding subspace of $L^1$ functions is suggested. A Crofton formula for flat sections of the perimeter is shown. Finally, random processes of particles...

arxiv.org/abs/2211.12319v1

A Tensor Restriction Theorem over Finite Fields

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no infinite...

arxiv.org/abs/1510.07604v1

Finite range decomposition for a general class of elliptic operators

We consider a family of gradient Gaussian vector fields on $\Z^d$, where the covariance operator is not translation invariant. A uniform finite range decomposition of the corresponding covariance operators is proven, i.e., the covariance operator can...

arxiv.org/abs/0810.3223v1

The critical number of finite abelian groups

Let G be an additive, finite abelian group. The critical number $\mathsf{cr}(G)$ of $G$ is the smallest positive integer $\ell$ such that for every subset $S \subset G \setminus \{0\}$ with $|S| \ge \ell$ the following holds: Every element of $G$ c...

en.wikipedia.org/wiki/Fano_plane

Fano plane - Wikipedia

In finite geometry, the Fano plane (named after Gino Fano) is a finite projective plane with the smallest possible number of points and lines: 7 points

en.wikipedia.org/wiki/Graph_toughness

Graph toughness - Wikipedia

is t-tough; this is a finite number for all finite graphs except the complete graphs, which by convention have infinite toughness. Graph toughness was

arxiv.org/abs/1501.07132v1

On Kalman-Like Finite Impulse Response Filters

This note reveals an explicit relationship between two representative finite impulse response (FIR) filters, i.e. the newly derived and popularized Kalman-Like unbiased FIR filter (UFIR) and the receding horizon Kalman FIR filter (RHKF). It is pointe...

arxiv.org/abs/2010.13987v5

Stabilizers of Stationary Actions of Lattices in Semisimple Groups

Every stationary action of a strongly irreducible lattice or commensurator of such a latiice in a general semisimple group, with at least one higher-rank connected factor, either has finite stabilizers almost surely or finite index stabilizers almost...

arxiv.org/abs/1808.05352v2

Sparse Multivariate ARCH Models: Finite Sample Properties

We provide finite sample properties of sparse multivariate ARCH processes, where the linear representation of ARCH models allows for an ordinary least squares estimation. Under the restricted strong convexity of the unpenalized loss function, regular...

arxiv.org/abs/2112.14992v6

Finite solvable groups with a nilpotent normal complement subgroup

Let $G$ be a finite solvable group and $H$ a non-normal core-free subgroup of $G$. We show that if the normalizer of any non-trivial normal subgroup of $Fit(H)$ is equal $H$, then $H$ has a nilpotent normal complement $K$ such that $G=KH$ and $KZ(Fit...

arxiv.org/abs/1903.06090v1

Characterization of P-groups By Sum of Element Orders

Let $G$ be a finite group. Then we denote $ψ(G) = \sum_{x\in G}o(x)$ where $o(x)$ is the order of the element $x$ in $G$. In this paper we characterize some finite $p$-groups ($p$ a prime) by $ψ$ and their orders....