English
Related papers

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

200 papers

In 1878, Jordan showed that a finite subgroup of GL(n,C) contains an abelian normal subgroup whose index is bounded by a function of n alone. Previously, the author has given precise bounds. Here, we consider analogues for finite linear…

Group Theory · Mathematics 2007-09-21 Michael J. Collins

In 1934, Garrett Birkhoff has shown that the number of isomorphism classes of finite metabelian groups of order $p^{22}$ tends to infinity with $p$. More precisely, for each prime number $p$ there is a family…

Group Theory · Mathematics 2014-09-22 Markus Schmidmeier

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

Group Theory · Mathematics 2011-04-13 Khalid Bou-Rabee

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Data Structures and Algorithms · Computer Science 2013-04-19 Nikhil R. Devanur , Shaddin Dughmi , Roy Schwartz , Ankit Sharma , Mohit Singh

We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…

Data Structures and Algorithms · Computer Science 2023-06-06 Ameya Velingker , Maximilian Vötsch , David P. Woodruff , Samson Zhou

This paper proves that the category of vacant n-tuple groupoids is equivalent to the category of factorizations of groupoids by n subgroupoids. Moreover it extends this equivalence to the category of maximally exclusive n-tuple groupoids,…

Category Theory · Mathematics 2012-01-04 Dany Majard

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Group Theory · Mathematics 2014-09-02 E. I. Khukhro , P. Shumyatsky

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Programming Languages · Computer Science 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

Number Theory · Mathematics 2025-02-12 Aaron Manning , Alina Ostafe , Igor E. Shparlinski

Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…

Representation Theory · Mathematics 2010-09-07 Claus Michael Ringel

The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…

Logic in Computer Science · Computer Science 2008-09-25 F. Guidi

We work in a first-order setting where structures are spread out over a metric space, with quantification allowed only over bounded subsets. Assuming a doubling property for the metric space, we define a canonical {\em core} $\mathcal{J}$…

Logic · Mathematics 2022-02-23 Ehud Hrushovski

This paper studies the problem of testing if an input (Gamma,*), where Gamma is a finite set of unknown size and * is a binary operation over Gamma given as an oracle, is close to a specified class of groups. Friedl et al. [Efficient…

Data Structures and Algorithms · Computer Science 2021-10-05 Francois Le Gall , Yuichi Yoshida

A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each…

Combinatorics · Mathematics 2023-07-26 Barbara Maenhaut , Jeremy Mitchell , Anna Puskas

We develop the theory of $H$-graded manifolds for any finitely generated abelian group, using tools from representation theory. Furthermore, we introduce and investigate the notion of $H$-graded coverings of supermanifolds in the case where…

Differential Geometry · Mathematics 2025-11-24 Fernando A. Z. Santamaria , Elizaveta Vishnyakova

We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…

Group Theory · Mathematics 2025-04-17 M. H. Hooshmand , Stefan Kohl

We abstract the study of irreducible characters of finite groups vanishing on all but two conjugacy classes, initiated by S. Gagola, to irreducible characters of fusion rings whose kernel has maximal rank. These near-integral fusion rings…

Quantum Algebra · Mathematics 2024-07-24 Jingcheng Dong , Andrew Schopieray

We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…

Combinatorics · Mathematics 2018-07-24 Guillermo Matera , Mariana Pérez , Melina Privitelli

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

Numerical Analysis · Mathematics 2025-12-17 Álvaro Fernández Corral , Yahya Saleh

We use the factorization method to find the exact eigenvalues and eigenfunctions for a particle in a box with the delta function potential $V(x)=\lambda\delta(x-x_{0})$. We show that the presence of the potential results in the…

Quantum Physics · Physics 2012-11-28 Pouria Pedram , M. Vahabi
‹ Prev 1 8 9 10 Next ›