Related papers: Constructing linked systems of relative difference…
In this paper, we introduce the concept of graded extension dimension for a group graded ring R, denoted by gr.ext.dim(R). We prove that when R is strongly graded, its graded extension dimension coincides with the non-graded extension…
We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…
Sampling hidden populations is particularly challenging using standard sampling methods mainly because of the lack of a sampling frame. Respondent-driven sampling (RDS) is an alternative methodology that exploits the social contacts between…
In this paper, we study Random Dynamical Systems (RDSs) of homeomorphisms on the circle without a finite orbit. We characterize the topological dynamics of the associated semigroup by identifying the existence of invariant sets which are…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
We describe a new class of positive linear discrete-time switching systems for which the problems of stability or stabilizability can be resolved constructively. This class generalizes the class of systems with independently switching state…
In this paper, we construct a family of reductive groups, including all reductive groups up to a given rank. We also construct a similar versal family of quasi-split reductive groups. This result generalizes a former result of N.Avni and…
MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an…
In this paper, we consider a special kind of overconstrained 6R closed linkages which we call angle-symmetric 6R linkages. These are linkages with the property that the rotation angles are equal for each of the three pairs of opposite…
Maximum Distance Separable (MDS) matrices play a central role in coding theory and symmetric-key cryptography due to their optimal diffusion properties. In this paper, we present a construction of MDS matrices using skew polynomial rings \(…
It is well-understood that different algorithms, training processes, and corpora produce different word embeddings. However, less is known about the relation between different embedding spaces, i.e. how far different sets of embeddings…
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b)…
Our concern is the digitalization of line segments in two dimensions as considered by Chun et al.[Discrete Comput. Geom., 2009] and Christ et al.[Discrete Comput. Geom., 2012]. The key property that differentiates the research of Chun et…
Learning from a stream of tasks usually pits plasticity against stability: acquiring new knowledge often causes catastrophic forgetting of past information. Most methods address this by summing competing loss terms, creating gradient…
In this paper, we give constructions of strongly regular Cayley graphs and skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and our results generalize ten of the eleven sporadic…
We define and study root graded groups, that is, groups graded by finite root systems. This notion generalises several existing concepts in the literature, including in particular Jacques Tits' notion of RGD-systems. The most prominent…
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…
The additive closedness in the subset of an additive group is termed as r-value. The nature of closedness in different subsets of fixed size is observed as a spectrum of r-values. We enumerate r-values of subsets in finite fields of…
We establish data-driven versions of the System Level Synthesis (SLS) parameterization of achievable closed-loop system responses for a linear-time-invariant system over a finite-horizon. Inspired by recent work in data-driven control that…