Related papers: Skeleton Simplicial Evaluation Codes
Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew…
We construct finite element subspaces of the space of symmetric tensors with square-integrable divergence on a three-dimensional domain. These spaces can be used to approximate the stress field in the classical Hellinger--Reissner mixed…
Affine-invariant codes have attracted considerable attention due to their rich algebraic structure and strong theoretical properties. In this paper, we study a family of affine-invariant codes whose defining set consists of all descendants…
The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
In this paper, a finite element space is presented on quadrilateral grids which can provide consistent discretization for the biharmonic equations. The space consists of piecewise quadratic polynomials and is of minimal degree for the…
Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in this order. We are motivated by the problem of…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
We introduce a multi-scale framework for low-level vision, where the goal is estimating physical scene values from image data---such as depth from stereo image pairs. The framework uses a dense, overlapping set of image regions at multiple…
We prove that a map between two realcompact spaces is skeletal if and only if it is homeomorphic to the limit map of a skeletal morphism between w-spectra with surjective limit projections.
The near-axis description of optimised stellarator fields has proven to be a powerful tool both for design and understanding of this magnetic confinement concept. The description consists of an asymptotic model of the equilibrium in the…
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…
Just as the Hamming weight spectrum of a linear block code sheds light on the performance of a maximum likelihood decoder, the pseudo-weight spectrum provides insight into the performance of a linear programming decoder. Using properties of…
For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…
We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of…
We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…
By the simple finite element method, we study the symplectic, multisymplectic structures and relevant preserving properties in some semi-linear elliptic boundary value problem in one-dimensional and two-dimensional spaces respectively. We…
Wiltshire-Gordon has introduced a homotopy model for ordered configuration spaces on a given simplicial complex. That author asserts that, after a suitable subdivision, his model also works for unordered configuration spaces. We supply…
This paper addresses problems on the structural design of control systems taking explicitly into consideration the possible application to large-scale systems. We provide an efficient and unified framework to solve the following major…
Let $V=V(n,q)$ denote the vector space of dimension $n$ over the finite field with $q$ elements. A subspace partition ${\mathcal P}$ of $V$ is a collection of nontrivial subspaces of $V$ such that each nonzero vector of $V$ is in exactly…