Related papers: $\lambda$-fold near-factorizations of groups

This article contains several results for \lambda-Robertson functions, i.e., analytic functions $f$ defined on the unit disk $D$ satisfying $f(0) = f'(0)-1=0$ and $Re e^{-i\lambda} {1+zf"(z)/f'(z)} > 0$ in $D$, where $\lambda \epsilon…

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

In this paper, we study the parallelism between perfect numbers and Leinster groups and continue it by introducing the new concepts of almost and quasi Leinster groups which parallel almost and quasi perfect numbers. These are small…

Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…

An almost abelian Lie group is a solvable Lie group with a codimension-one normal abelian subgroup. We characterize almost Hermitian structures on almost abelian Lie groups where the almost complex structure is harmonic with respect to the…

We continue our study of ends of non-compact manifolds, with a focus on the inward tameness condition. For manifolds with compact boundary, inward tameness, has significant implications. For example, such manifolds have stable homology at…

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…

A finite group $G$ is called $k$-factorizable if for any factorization $|G|=a_1\cdots a_k$ with $a_i>1$ there exist subsets $A_i$ of $G$ with $|A_i|=a_i$ such that $G=A_1\cdots A_k$. We say that $G$ is \textit{multifold-factorizable} if $G$…

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

Clustering is a fundamental task in machine learning and data analysis, but it frequently fails to provide fair representation for various marginalized communities defined by multiple protected attributes -- a shortcoming often caused by…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra. While the problem…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

In this paper, we study arbitrary models of the first-order theory of a ring $A$ where the additive group $A$ is a finitely generated abelian group. Following an earlier paper by this author, Alexei G. Myasnikov and Francis Oger, we call…

In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…

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…

This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…

Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation.…

Let $\mathcal{U(\alpha, \lambda)}$, $0<\alpha <1$, $0 < \lambda <1$ be the class of functions $f(z)=z+a_{2}z^{2}+a_{3}z^{3}+\cdots$ satisfying $$\left|\left(\frac{z}{f(z)}\right)^{1+\alpha}f'(z)-1\right|<\lambda$$ in the unit disc ${\mathbb…

We study almost symmetric numerical semigroups and semigroup rings. We describe a characteristic property of the minimal free resolution of the semigroup ring of an almost symmetric numerical semigroup. For almost symmetric semigroups…