Related papers: Partial Difference Sets in $C_{2^n} \times C_{2^n}…

The stochastic partial differential equation approach to Gaussian processes (GPs) represents Mat\'ern GP priors in terms of $n$ finite element basis functions and Gaussian coefficients with sparse precision matrix. Such representations…

We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…

In this paper, we exhibit explicitly a sequence of $2\times2$ matrix valued orthogonal polynomials with respect to a weight $W_{p,n}$, for any pair of real numbers $p$ and $n$ such that $0<p<n$. The entries of these polynomiales are…

A finite group of order $n$ is said to have the distinct divisor property (DDP) if there exists a permutation $g_1,\ldots, g_n$ of its elements such that $g_i^{-1}g_{i+1} \neq g_j^{-1}g_{j+1}$ for all $1\leq i<j<n$. We show that an abelian…

For a group $G$ acting on an affine variety $X$, the separating variety is the closed subvariety of $X\times X$ encoding which points of $X$ are separated by invariants. We concentrate on the indecomposable rational linear representations…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…

We construct a set $M_d$ whose points parametrize families of Meixner polynomials in $d$ variables. There is a natural bispectral involution $b$ on $M_d$ which corresponds to a symmetry between the variables and the degree indices of the…

We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every…

We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of non-geometric metric GST instances with…

Partial differential equations (PDEs) are important tools to model physical systems and including them into machine learning models is an important way of incorporating physical knowledge. Given any system of linear PDEs with constant…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\gamma>0$, we give a $n^{O(\log n)}$ time algorithm that given a…

Using a class of permutation polynomials of $F_{3^{2h+1}}$ obtained from the Ree-Tits symplectic spreads in $PG(3,3^{2h+1})$, we construct a family of skew Hadamard difference sets in the additive group of $F_{3^{2h+1}}$. With the help of a…

In this paper we study the general group classification of systems of linear second-order ordinary differential equations inspired from earlier works and recent results on the group classification of such systems. Some interesting results…

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

We present a local algorithm producing an independent set of expected size $0.44533n$ on large-girth 3-regular graphs and $0.40407n$ on large-girth 4-regular graphs. We also construct a cut (or bisection or bipartite subgraph) with…

We compute the Gauss-Manin differential equation for any period of a polynomial in \ $\C[x_{0},\dots, x_{n}]$ \ with \ $(n+2)$ \ monomials. We give two general factorizations theorem in the algebra \ $\C< z, (\frac{\partial}{\partial…

We present a sound and complete algorithm, called iterative causal discovery (ICD), for recovering causal graphs in the presence of latent confounders and selection bias. ICD relies on the causal Markov and faithfulness assumptions and…

Generative adversarial networks (GANs) have shown great success in applications such as image generation and inpainting. However, they typically require large datasets, which are often not available, especially in the context of prediction…