相关论文: Tight Frame with Hahn and Krawtchouk Polynomials o…

This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.

Under certain natural sufficient conditions on the sequence of uniformly bounded closed sets $E_k\subset\mathbb{R}$ of admissible coefficients, we construct a polynomial $P_n(x)=1+\sum_{k=1}^n\varepsilon_k x^k$, $\varepsilon_k\in E_k$, with…

Exotic phases of matter emerge from the interplay between strong electron interactions and non-trivial topology. Owing to their lack of dispersion at the single-particle level, systems harboring flat bands are excellent testbeds for…

A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…

Shearlet tight frames have been extensively studied during the last years due to their optimal approximation properties of cartoon-like images and their unified treatment of the continuum and digital setting. However, these studies only…

For the Hahn and Krawtchouk polynomials orthogonal on the set $\{0, \ldots,N\}$ new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These…

We show that if a closed, oriented 3-manifold M is promised to be homeomorphic to a lens space L(n,k) with n and k unknown, then we can compute both n and k in polynomial time in the size of the triangulation of M. The tricky part is the…

With the aid of utilising tensor products, we give a simplified proof to the fundamental theorem of Benedetto and Fickus about the existence and characterisation of finite, normalised tight frames. We also establish unit-norm tensor…

Let ${\bf K} = (K_1, ..., K_n)$ be an $n$-tuple of convex compact subsets in the Euclidean space $\R^n$, and let $V(\cdot)$ be the Euclidean volume in $\R^n$. The Minkowski polynomial $V_{{\bf K}}$ is defined as $V_{{\bf K}}(\lambda_1, ...…

The main aim of this paper is to construct explicitly orthogonal bases for the spaces of k-homogeneous polynomial solutions of the Hodge-de Rham system in the Euclidean space R^m which take values in the space of s-vectors. Actually, we…

Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recently, significant improvements were made in higher dimensions, leading to new methods to reconstruct large classes…

In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed…

In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed…

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…

Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

We turn a given filter bank into a filtering scheme that provides perfect reconstruction, synthesis is the adjoint of the analysis part (so-called unitary filter banks), all filters have equal norm, and the essential features of the…

Motivated by new capabilities to realise artificial gauge fields in ultracold atomic systems, and by their potential to access correlated topological phases in lattice systems, we present a new strategy for designing topologically…

This paper develops an efficient algorithm for computing the Euclidean projection onto the top-k-sum constraint, a key operation in financial risk management and matrix optimization problems. Existing projection methods rely on sorting and…

We give combinatorial proofs of two types of duality for Grothendieck polynomials by constructing a unified combinatorial framework incorporating set-valued tableaux, musltiset-valued tableaux, reverse plane partitions and valued-set…