Related papers: Cyclotomic skew partial difference sets and partia…

This paper studies adaptive first-order least-squares finite element methods for second-order elliptic partial differential equations in non-divergence form. Unlike the classical finite element method which uses weak formulations of PDEs…

We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a broader range of code lengths and codes rates. Similar…

A weakly infeasible semidefinite program (SDP) has no feasible solution, but it has approximate solutions whose constraint violation is arbitrarily small. These SDPs are ill-posed and numerically often unsolvable. They are also closely…

We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

This paper is part of a series of papers in which we have investigated the differential smoothness of families of noncommutative algebras. Here, we consider this topic for the family 3-dimensional skew polynomial rings characterized by Bell…

A novel algorithm that produces a quad layout based on imposed set of singularities is proposed. In this paper, we either use singularities that appear naturally, e.g., by minimizing Ginzburg-Landau energy, or use as an input user-defined…

We present a new family of embedded doubly periodic minimal surfaces, of which the symmetry group does not coincide with any other example known before.

A finite set system (FSS) is a pair (V; B) where V is a finite set whose members are called points, equipped with a finite collection of its subsets B whose members are called blocks. In this paper, finite set systems are used to define a…

Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of…

The skew Schubert polynomials are those which are indexed by skew elements of the Weyl group, in the sense of arXiv:0812.0639. We obtain tableau formulas for the double versions of these polynomials in all four classical Lie types, where…

An explicit structure relation for Askey-Wilson polynomials is given. This involves a divided q-difference operator which is skew symmetric with respect to the Askey-Wilson inner product and which sends polynomials of degree n to…

We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the…

This paper presents a novel adaptive-sparse polynomial dimensional decomposition (PDD) method for stochastic design optimization of complex systems. The method entails an adaptive-sparse PDD approximation of a high-dimensional stochastic…

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Almost difference sets have emerged as a fascinating and important area of research as they can produce functions with optimal nonlinearity, cyclic codes, and binary sequences with optimal autocorrelation. This study aims to investigate the…

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…