Related papers: Certain Diagonal Equations and Conflict-Avoiding C…
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…
In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…
We propose an adaptive refinement algorithm to solve total variation regularized measure optimization problems. The method iteratively constructs dyadic partitions of the unit cube based on i) the resolution of discretized dual problems and…
Quantum error correction (QEC) is essential for operating quantum computers in the presence of noise. Here, we accurately decode arbitrary Calderbank-Shor-Steane (CSS) codes via the maximum satisfiability (MaxSAT) problem. We show how to…
We consider three types of isogonal conjugacy of two points with respect to a given triangle and characterize any of these types by a geometric equality. As an application to the Fermat problem with positive weights, we prove that in the…
We consider adaptive finite element methods (AFEMs) with inexact algebraic solvers for second-order symmetric linear elliptic diffusion problems. Optimal complexity of AFEM, i.e., optimal convergence rates with respect to the overall…
We prove that if $E \subset {\mathbb F}_q^2$, $q \equiv 3 \mod 4$, has size greater than $Cq^{7/4}$, then $E$ determines a positive proportion of all congruence classes of triangles in ${\mathbb F}_q^2$. The approach in this paper is based…
This paper proposes a computational approach to form-find pin-jointed, bar structures subjected to combinations of tension and compression forces. The generated equilibrium states can meet force and geometric constraints via gradient-based…
Let $E\subset\mathbb{F}_q^d$ and $\lVert \cdot \rVert:\mathbb{F}_q^d\to \mathbb{F}_q$ defined as $\lVert \alpha\rVert:= \alpha_1^2+\dots+\alpha_d^2$ if $\alpha=(\alpha_1,\dots,\alpha_d)\in \mathbb{F}_q^d$, where $\mathbb{F}_q^d$ is the…
We show that a class of divergence-form elliptic problems with quadratic growth in the gradient and non-coercive zero order terms are solvable, under essentially optimal hypotheses on the coefficients in the equation. In addition, we prove…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
We consider the preconditioned conjugate gradient method (PCG) with optimal preconditioner in the frame of the boundary element method (BEM) for elliptic first-kind integral equations. Our adaptive algorithm steers the termination of PCG as…
The past decade has seen a significant interest in learning tractable probabilistic representations. Arithmetic circuits (ACs) were among the first proposed tractable representations, with some subsequent representations being instances of…
This is the second part of a two-part series of papers. In this paper, for the generalized non-orthogonal amplify and forward (GNAF) protocol presented in Part-I, a construction of a new family of distributed space-time codes based on…
In optimal experimental design, the objective is to select a limited set of experiments that maximizes information about unknown model parameters based on factor levels. This work addresses the generalized D-optimal design problem, allowing…
Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this paper, we are…
We present improved approximation algorithms for some problems in the related areas of Capacitated Network Design and Flexible Graph Connectivity. In the Cap-$k$-ECSS problem, we are given a graph $G=(V,E)$ whose edges have non-negative…
In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…