Related papers: Multicast Networks Solvable over Every Finite Fiel…
Gaussian random fields play an important role in many areas of science and engineering. In practice, they are often simulated by sampling from a high-dimensional multivariate normal distribution, which arises from the discretisation of a…
In this work, an efficient blackbox-type multigrid method is proposed for solving multipoint flux approximations of the Darcy problem on logically rectangular grids. The approach is based on a cell-centered multigrid algorithm, which…
Machine learning methods on graphs have proven useful in many applications due to their ability to handle generally structured data. The framework of Gaussian Markov Random Fields (GMRFs) provides a principled way to define Gaussian models…
An analytically tractable model for Gaussian multiuser channels with fading is studied, and the capacity region of this model is found to be a good approximation of the capacity region of the original Gaussian network. This work extends the…
Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…
Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC is strongly related to and can be effectively studied using matroid theory…
A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a "viewing graph". Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration…
Let $f(x)=x^8+ax^4+b \in \mathbb{Q}[x]$ be an irreducible polynomial where $b$ is a square. We give a method that completely describes the factorization patterns of a linear resolvent of $f(x)$ using simple arithmetic conditions on $a$ and…
For a Galois extension $K/F$ with $\text{char}(K)\neq 2$ and $\text{Gal}(K/F) \simeq \mathbb{Z}/2\mathbb{Z}\oplus\mathbb{Z}/2\mathbb{Z}$, we determine the $\mathbb{F}_2[\text{Gal}(K/F)]$-module structure of $K^\times/K^{\times 2}$. Although…
We study Stanley-Reisner ideals of broken circuits complexes and characterize those ones admitting a linear resolution or being complete intersections. These results will then be used to characterize arrangements whose Orlik-Terao ideal has…
We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].
We show that every GL(2, R) orbit closure of translation surfaces is either a connected component of a stratum, the hyperelliptic locus, or consists entirely of surfaces whose Jacobians have extra endomorphisms. We use this result to give…
Computing at the exascale level is expected to be affected by a significantly higher rate of faults, due to increased component counts as well as power considerations. Therefore, current day numerical algorithms need to be reexamined as to…
We study the convergence properties of the Gibbs Sampler in the context of posterior distributions arising from Bayesian analysis of conditionally Gaussian hierarchical models. We develop a multigrid approach to derive analytic expressions…
This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…
Let K/F be a cyclic field extension of odd prime degree. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F)]-modules. For these…
We propose a convenient matrix-free neural architecture for the multigrid method. The architecture is simple enough to be implemented in less than fifty lines of code, yet it encompasses a large number of distinct multigrid solvers. We…
We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…
We examine in detail the stable reduction of Galois covers of the projective line over a complete discrete valuation field of mixed characteristic (0, p), where G has a cyclic p-Sylow subgroup of order p^n. If G is further assumed to be…
In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense…