Related papers: Partial Difference Sets with Denniston Parameters …

Fully connected multilayer perceptrons are used for obtaining numerical solutions of partial differential equations in various dimensions. Independent variables are fed into the input layer, and the output is considered as solution's value.…

For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4…

We study averaging for Stochastic Differential Equations (SDEs) and Poisson equations. We succeed in obtaining a uniform in time (UiT) averaging result, with a rate, for fully coupled SDE models with super-linearly growing coefficients.…

We prove partial regularity for minimizers to elasticity type energies in the nonlinear framework {with $p$-growth, $p>1$,} in dimension $n\geq 3$. It is an open problem in such a setting either to establish full regularity or to provide…

We provide the first explicit examples of deformations of higher dimensional quadrics: a straightforward generalization of Peterson's explicit 1-dimensional family of deformations in $\mathbb{C}^3$ of 2-dimensional general quadrics with…

In this paper, I show that if $p$ is an odd prime, and if $P$ is a finite $p$-group, then there exists an exact sequence of abelian groups $$0\to T(P)\to D(P)\to\lproj{P}\to H^1\big(\apdeux(P),\Z\big)^{(P)},$$ where $D(P)$ is the Dade group…

In this paper, two new families of MDS quantum convolutional codes are constructed. The first one can be regarded as a generalization of \cite[Theorem 6.5]{GGGlinear}, in the sense that we do not assume that $q\equiv1\pmod{4}$. More…

We present quasi-diagonal preconditioners for piecewise polynomial discretizations of pseudodifferential operators of order minus two in any space dimension. Here, quasi-diagonal means diagonal up to a sparse transformation. Considering…

The discrepant posterior phenomenon (DPP) is a counter-intuitive phenomenon that can frequently occur in a Bayesian analysis of multivariate parameters. It refers to the phenomenon that a parameter estimate based on a posterior is more…

Let F_q be a finite field of order q with characteristic p. An arc is an ordered family of at least k vectors in (F_q)^k in which every subfamily of size k is a basis of (F_q)^k. The MDS conjecture, which was posed by Segre in 1955, states…

In this paper we prove non-existence of nontrivial partial difference sets in Abelian groups of order 8p^3, where p \geq 3 is a prime number.

We construct quantum MDS codes with parameters $ [\![ q^2+1,q^2+3-2d,d ]\!] _q$ for all $d \leqslant q+1$, $d \neq q$. These codes are shown to exist by proving that there are classical generalised Reed-Solomon codes which contain their…

Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…

The lower the distortion of an estimator, the more the distribution of its outputs generally deviates from the distribution of the signals it attempts to estimate. This phenomenon, known as the perception-distortion tradeoff, has captured…

This paper studies the abelian subalgebras and ideals of maximal dimension of Poisson algebras $\mathcal{P}$ of dimension $n$. We introduce the invariants $\alpha$ and $\beta$ for Poisson algebras, which correspond to the dimension of an…

We discuss the the notion of a partial dynamical symmetry (PDS), for which a prescribed symmetry is obeyed by only a subset of solvable eigenstates, while other eigenstates are strongly mixed. We present an explicit construction of…

The maximal rate for non-square Complex Orthogonal Designs (CODs) with $n$ transmit antennas is ${1/2}+\frac{1}{n}$ if $n$ is even and ${1/2}+\frac{1}{n+1}$ if $n$ is odd, which are close to 1/2 for large values of $n.$ A class of maximal…

Inapproximability results for $\mathsf{Max\,k\,CSP\!-\!q}$ have been traditionally established using balanced $t$-wise independent distributions, which are closely related to orthogonal arrays, a famous family of combinatorial designs. In…

Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…

Maximum Distance Separable (MDS) convolutional codes are cha- racterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Z p r was recently discovered in…