Related papers: A Survey on Almost Difference Sets

The level set estimation problem seeks to find all points in a domain ${\cal X}$ where the value of an unknown function $f:{\cal X}\rightarrow \mathbb{R}$ exceeds a threshold $\alpha$. The estimation is based on noisy function evaluations…

This work deals with almost automorphy of distributions. We give characterizations and main properties of these distributions. We also study the existence of distributional almost automorphic solutions of linear difference-differential…

We compute almost-complex invariants $h^{p,0}_{\overline\partial}$, $h^{p,0}_{\text{Dol}}$ and almost-Hermitian invariants $h^{p,0}_{\bar\delta}$ on families of almost-K\"ahler and almost-Hermitian $6$-dimensional solvmanifolds. Finally, as…

Mixture models, such as Gaussian mixture models, are widely used in machine learning to represent complex data distributions. A key challenge, especially in high-dimensional settings, is to determine the mixture order and estimate the…

Subadditive set functions play a pivotal role in computational economics (especially in combinatorial auctions), combinatorial optimization or artificial intelligence applications such as interpretable machine learning. However, specifying…

In [1], a new quasi-Hermitian variety $\mathcal{H}_\varepsilon^r$ in $\mathrm{PG}(r, q^2)$, with $q = 2^e$ and $e \geq 3$ an odd integer, was constructed. The variety depends on a primitive element $\varepsilon$ of the underlying field…

The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd$(v,n)>1$. It is remarkable that all the known difference sets with…

In this paper, we want to clarify the Gibbs phenomenon when continuous and discontinuous finite elements are used to approximate discontinuous or nearly discontinuous PDE solutions from the approximation point of view. For a simple step…

Set functions with convenient properties (such as submodularity) appear in application areas of current interest, such as algorithmic game theory, and allow for improved optimization algorithms. It is natural to ask (e.g., in the context of…

We consider estimating the parametric components of semi-parametric multiple index models in a high-dimensional and non-Gaussian setting. Such models form a rich class of non-linear models with applications to signal processing, machine…

Let $G$ be a group. A ring $R$ is called a graded ring (or $G$-graded ring) if there exist additive subgroups $R_{\alpha }$ of $R$ indexed by the elements $\alpha \in G$ such that $R=\bigoplus_{\alpha \in G}R_{\alpha }$ and $R_{\alpha…

We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…

We show that almost split sequences in the category of comodules over a coalgebra with finite-dimensional right-hand term are direct limits of almost split sequences over finite dimensional subcoalgebras. In previous work we showed that…

In this paper, we investigate the problem of classifying feature vectors with mutually independent but non-identically distributed elements. First, we show the importance of this problem. Next, we propose a classifier and derive an…

Let $G=QD_{8k}~$ be the quasi-dihedral group of order $8n$ and $\theta$ be an automorphism of $QD_{8k}$ of finite order. The fixed-point set $H$ of $\theta$ is defined as $H_{\theta}=G^{\theta}=\{x\in G \mid \theta(x)=x\}$ and generalized…

Bodlaender and Koster (Discrete Mathematics 2006) introduced the notion of almost-clique separators in the context of computing the treewidth $\tw(G)$ of a given graph $G$. A separator $S \subseteq V(G)$ of $G$ is an \emph{almost-clique…

In this paper, we characterize all discrete-time systems in quasi-standard form admitting coalgebra symmetry with respect to the Lie--Poisson algebra $\mathfrak{h}_{6}$. The outcome of this study is a family of systems depending on an…

Let A be an exact category, that is, an extension-closed full subcategory of an abelian category. Firstly, we give some necessary and sufficient conditions for A to have almost split sequences. Then, we study when an almost split sequence…

Let $\mbox{interval} + k v$, $\mbox{interval} + k e$, and $\mbox{interval} - k e$ denote the classes of graphs that can be obtained from some interval graph by adding $k$ vertices, adding $k$ edges, and deleting $k$ edges, respectively.…

Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…