Related papers: A solution of an equivalence problem for semisimpl…

This article is devoted to the construction of numerical methods which remain insensitive to the smallness of the semiclassical parameter for the linear Schr{\"o}dinger equation in the semiclassical limit. We specifically analyse the…

In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the…

Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both…

We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…

We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…

In a recent paper, Tang and Ding introduced a class of binary cyclic codes of rate close to one half with a designed lower bound on their minimum distance. The definition involves the base $2$ expansion of the integers in their defining…

Source coding is the canonical problem of data compression in information theory. In a locally encodable source coding, each compressed bit depends on only few bits of the input. In this paper, we show that a recently popular model of…

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…

This paper is devoted to the study of the existence and uniqueness of global admissible conservative weak solutions for the periodic single-cycle pulse equation. We first transform the equation into an equivalent semilinear system by…

In this paper we obtain, for a semilinear elliptic problem in R^N, families of solutions bifurcating from the bottom of the spectrum of $-\Delta$. The problem is variational in nature and we apply a nonlinear reduction method which allows…

As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a…

We present in this paper our solver for logic grid puzzles. The approach used by our algorithm mimics the way a human would try to solve the same problem. Every progress made during the solving process is accompanied by a detailed…

We obtain comparison theorems for non-negative solutions of quasilinear elliptic inequalities

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of…

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…

In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the numerical semidefinite programming performance estimation…

This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we derive formulas for random access under a storage scheme that…