Related papers: A probabilistic algorithm for the secant defect of…
We study affine Grassmannians for ramified triality groups. These groups are of type ${}^3D_4$, so they are forms of the orthogonal or the spin groups in 8 variables. They can be given as automorphisms of certain twisted composition…
The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…
In this paper we propose a novel staggered discontinuous Galerkin method for the Brinkman problem on general quadrilateral and polygonal meshes. The proposed method is robust in the Stokes and Darcy limits, in addition, hanging nodes can be…
We study a posteriori error analysis of linear-quadratic boundary control problems under bilateral box constraints on the control which acts through a Neumann type boundary condition. We adopt the hybridizable discontinuous Galerkin method…
This article proposes a novel least-squares weak Galerkin (LS-WG) method for second-order elliptic equations in non-divergence form. The approach leverages a locally defined discrete weak Hessian operator constructed within the weak…
We introduce a novel probabilistic group testing framework, termed Poisson group testing, in which the number of defectives follows a right-truncated Poisson distribution. The Poisson model has a number of new applications, including…
Deriving Bayesian inference for exponential random graph models (ERGMs) is a challenging "doubly intractable" problem as the normalizing constants of the likelihood and posterior density are both intractable. Markov chain Monte Carlo (MCMC)…
This paper applies the gradient discretisation method (GDM) for fourth order elliptic variational inequalities. The GDM provides a new formulation of error estimates and a complete convergence analysis of several numerical methods. We show…
We present a posteriori error analysis in the supremum norm for the symmetric interior penalty discontinuous Galerkin method for the elliptic obstacle problem. We construct discrete barrier functions based on appropriate corrections of the…
A difficult problem in the theory of random tensors is to calculate the expectation values of polynomials in the tensor entries, even in the large N limit and in a Gaussian distribution. Here we address this issue, focusing on a family of…
Let A be an abelian variety over a number field k. We show that weak approximation holds in the Weil-Ch\^atelet group of A/k but that it may fail when one restricts to the n-torsion subgroup. This failure is however relatively mild; we show…
A variation of Waring's problem from classical number theory is the question, ``What is the smallest number $s$ such that any generic homogeneous polynomial of degree $d$ in $n+1$ variables may be written as the sum of at most $s$ products…
We realise the Bott-Samelson resolutions of type A Schubert varieties as quiver Grassmannians. In order to explicitly describe this isomorphism, we introduce the notion of a \textit{geometrically compatible} decomposition for any…
This paper proposes and analyzes a class of weak Galerkin (WG) finite element methods for stationary natural convection problems in two and three dimensions. We use piecewise polynomials of degrees k, k-1, and k(k>=1) for the velocity,…
In this paper we consider the problem of determining the weight spectrum of q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m=6 this was done by Nogin. We derive a formula for the weight of a codeword of C(3,m), in terms…
In this work, the authors introduce a generalized weak Galerkin (gWG) finite element method for the time-dependent Oseen equation. The generalized weak Galerkin method is based on a new framework for approximating the gradient operator.…
We study the local differential geometry of varieties $X^n\subset \Bbb C\Bbb P^{n+a}$ with degenerate secant and tangential varieties. We show that the second fundamental form of a smooth variety with degenerate tangential variety is…
We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor…
We consider the question of determining the probability of triangle count deviations in the Erd\H{o}s-R\'enyi random graphs $G(n,m)$ and $G(n,p)$ with densities larger than $n^{-1/2}(\log{n})^{1/2}$. In particular, we determine the log…
Monte Carlo matrix trace estimation is a popular randomized technique to estimate the trace of implicitly-defined matrices via averaging quadratic forms across several observations of a random vector. The most common approach to analyze the…