Related papers: $\delta$-sequences and Evaluation Codes defined by…

Given a well-ordered semi-group $\Gamma$ with a minimal system of generators of ordinal type at most $\omega n$ and of rational rank $r$, which satisfies a positivity and increasing condition, we construct a zero-dimensional valuation…

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…

We provide a framework for relating certain q-series defined by sums over partitions to multiple zeta values. In particular, we introduce a space of polynomial functions on partitions for which the associated q-series are q-analogues of…

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…

This paper continues the investigation of non-zero determinants associated with finite semigroups containing a pair of non-commuting idempotents, as initiated in~\cite{Sha-Det2}. We focus on a class of semigroups, called \( \lll \)-smooth…

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

With the recent advancements in deep learning, neural solvers have gained promising results in solving math word problems. However, these SOTA solvers only generate binary expression trees that contain basic arithmetic operators and do not…

Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often…

This paper introduces a new class of error-correcting codes constructed from the ideal lattices of finite commutative ternary Gamma-semirings (TGS). Unlike classical linear or ring-linear codes, which rely on binary operations, TGS codes…

Let $f$ be a continuous real function defined in a subset of the real line. The standard definition of continuity at a point $x$ allow us to correlate any given epsilon with a (possibly depending of $x$) delta value. This pairing is known…

The aim of this paper is to build a theory of commutative and noncommutative {\it injective} valuations of various algebras (including algebras with zero divisors). The targets of our valuations are (well-)ordered commutative and…

We introduce the class of plane valuations at infinity and prove an analogue to the Abhyankar-Moh (semigroup) Theorem for it.

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

An exposition on Spivakovsky's dual graphs of valuations on function fields of dimension two is first given, leading to a proof of minimal generating sequences for the non-divisorial valuations. It should be noted that the definition of…

We study asymptotic jumping numbers for graded sequences of ideals, and show that every such invariant is computed by a suitable real valuation of the function field. We conjecture that every valuation that computes an asymptotic jumping…