Related papers: Nonabelian partial difference sets constructed usi…
A recent result of Balandraud shows that for every subset S of an abelian group G, there exists a non trivial subgroup H such that |TS| <= |T|+|S|-2 holds only if the stabilizer of TS contains H. Notice that Kneser's Theorem says only that…
Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…
A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple…
A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…
Based on the construction of Poisson-Lie T-dual $\sigma$-models from a common parent action we study a candidate for the non-abelian respectively Poisson-Lie T-duality group. This group generalises the well-known abelian T-duality group…
Explicit, unconditionally stable, high-order schemes for the approximation of some first- andsecond-order linear, time-dependent partial differential equations (PDEs) are proposed.The schemes are based on a weak formulation of a…
Partial Least Squares (PLS) refer to a class of dimension-reduction techniques aiming at the identification of two sets of components with maximal covariance, to model the relationship between two sets of observed variables…
Robust physics discovery is of great interest for many scientific and engineering fields. Inspired by the principle that a representative model is the one simplest possible, a new model selection criteria considering both model's Parsimony…
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
We propose a two-stage method called \textit{Spline Assisted Partial Differential Equation based Model Identification (SAPDEMI)} to identify partial differential equation (PDE)-based models from noisy data. In the first stage, we employ the…
Parameter identification problems in partial differential equations (PDEs) consist in determining one or more functional coefficient in a PDE. In this article, the Bayesian nonparametric approach to such problems is considered. Focusing on…
Computation biology helps to understand all processes in organisms from interaction of molecules to complex functions of whole organs. Therefore, there is a need for mathematical methods and models that deliver logical explanations in a…
We study notions such as finite presentability and coherence, for partially ordered abelian groups and vector spaces. Typical results are the following: (i) A partially ordered abelian group G is finitely presented if and only…
Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…
This paper addresses the question whether triple arrays can be constructed from Youden squares developed from difference sets. We prove that if the difference set is abelian, then having $-1$ as multiplier is both a necessary and sufficient…
A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=ab^{-1}$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is called…
In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…
Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…
We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…