Related papers: Near orders and codes
We introduce two applications of polygraphs to categorification problems. We compute first, from a coherent presentation of an $n$-category, a coherent presentation of its Karoubi envelope. For this, we extend the construction of Karoubi…
We provide a criterion for the existence of right approximations in cocomplete additive categories; it is a straightforward generalisation of a result due to El Bashir. This criterion is used to construct adjoint functors in homotopy…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
We study operator-splitting schemes for approximating Koopman generators of linear semigroups induced by nonlinear flows, a framework originating with Dorroh and Neuberger. Building on ideas of Lie, Kowalewski, and Gr\"{o}bner, we analyze…
Homotopical localizations with respect to a set of maps are known to exist in cofibrantly generated model categories (satisfying additional assumptions). In this paper we expand the existing framework, so that it will apply to not…
We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
We present two new classes of orthogonal functions, log orthogonal functions (LOFs) and generalized log orthogonal functions (GLOFs), which are constructed by applying a $\log$ mapping to Laguerre polynomials. We develop basic approximation…
We consider the problem of finding a Hamiltonian path with precedence constraints in the form of a partial order on the vertex set. This problem is known as Partially Ordered Hamiltonian Path Problem (POHPP). Here, we study the complexity…
Trigonometric formulas are derived for certain families of associated Legendre functions of fractional degree and order, for use in approximation theory. These functions are algebraic, and when viewed as Gauss hypergeometric functions,…
Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…
We develop the local Morse theory for a class of non-twice continuously differentiable functionals on Hilbert spaces, including a new generalization of the Gromoll-Meyer's splitting theorem and a weaker Marino-Prodi perturbation type…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
Geometric Quantization links holomorphic geometry with real geometry, a relation that is a prototype for the modern development of mirror symmetry. We show how to use this treatment to construct a special basis in every space of conformal…
We extend the graph convolutional network method for deep learning on graph data to higher order in terms of neighboring nodes. In order to construct representations for a node in a graph, in addition to the features of the node and its…
Probabilistic submeasures generalizing the classical (numerical) submeasures are introduced and discussed in connection with some classes of aggregation functions. A special attention is paid to triangular norm-based probabilistic…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
The ordering of block copolymers into lamellar microstructures is an attractive route for creating nanopatterns on scales too small to be constructed by current photolithography techniques. This utilises a technique known as graphoepitaxy…
We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.
For a function algebra A we investigate relations between the following three topics: isomorphisms of singly generated A-modules, Morita equivalence bimodules, and `real harmonic functions' with respect to A. We also consider certain groups…