English
Related papers

Related papers: $\alpha$-$\beta$-Factorization and the Binary Case…

200 papers

Let $k$ be a field containing an algebraically closed field of characteristic zero. If $G$ is a finite group and $D$ is a division algebra over $k$, finite dimensional over its center, we can associate to a faithful $G$-grading on $D$ a…

Rings and Algebras · Mathematics 2020-09-08 Eli Aljadeff , Darrell Haile , Yakov Karasik

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

Group Theory · Mathematics 2026-04-23 Mikhail Kabenyuk

One compelling use of citation networks is to characterize papers by their relationships to the surrounding literature. We propose a method to characterize papers by embedding them into two distinct "co-factor" spaces: one describing how…

Methodology · Statistics 2025-10-07 Alex Hayes , Karl Rohe

The investigation and classification of non-unique factorization phenomena has attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P.A. Garc\'ia-S\'anchez, together with several co-authors, derived…

Number Theory · Mathematics 2011-04-05 Andreas Philipp

The set of finite words over a well-quasi-ordered set is itself well-quasi-ordered. This seminal result by Higman is a cornerstone of the theory of well-quasi-orderings and has found numerous applications in computer science. However, this…

Formal Languages and Automata Theory · Computer Science 2025-01-14 Nathan Lhote , Aliaume Lopez , Lia Schütze

The Fundamental Theorem of Algebra (FTA) asserts that every complex polynomial has as many complex roots, counted with multiplicities, as its degree. A probabilistic analogue of this theorem for real roots of real polynomials, commonly…

Algebraic Geometry · Mathematics 2025-11-25 Boris Kazarnovskii

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Machine Learning · Computer Science 2008-06-26 Marcus Hutter

A problem by Feichtinger, Heil, and Larson asks whether every infinite matrix $A$ with $\sum_{k,l}|A_{kl}| < \infty$ (an equivalent substitute for the Feichtinger algebra) that is positive-semidefinite admits a symmetric rank-one…

Functional Analysis · Mathematics 2026-05-11 Radu Balan , Fushuai Jiang

We study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes, with the extra condition that the ordered concatenation of elements of this…

Combinatorics · Mathematics 2018-02-26 Caius Wojcik

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

Combinatorics · Mathematics 2014-10-31 Krasimir Yordzhev

This article provides a gentle introduction for a general mathematical audience to the factorization theory of motion polynomials and its application in mechanism science. This theory connects in a rather unexpected way a seemingly abstract…

Rings and Algebras · Mathematics 2015-07-21 Gábor Hegedüs , Zijia Li , Josef Schicho , Hans-Peter Schröcker

Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…

Combinatorics · Mathematics 2015-03-05 Wenjie Fang

We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…

Combinatorics · Mathematics 2026-04-03 Boris Alexeev , Moe Putterman , Mehtaab Sawhney , Mark Sellke , Gregory Valiant

We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao's celebrated addition-deletion theorem for free arrangements for…

Combinatorics · Mathematics 2016-01-18 Torsten Hoge , Gerhard Roehrle

The linearization of a quadratic form gives rise to a Clifford algebra structure, as seen in Dirac's factorization of the d'Alembert operator. A similar structure known as a generalized Clifford algebra arises from the continuation of this…

Mathematical Physics · Physics 2023-05-16 Erin T. Albertin , Zachary P. Bradshaw , Kaitlyn M. Kirt , Kathryn E. Long , Anthony Nguyen

We construct and study new generalisations to rooted trees and forests of some properties of shuffles of words. First, we build a coproduct on rooted trees which, together with their shuffle, endow them with bialgebra structure. We then…

Combinatorics · Mathematics 2025-01-07 Pierre J. Clavier , Douglas Modesto

We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…

Classical Analysis and ODEs · Mathematics 2014-01-16 H. Sedaghat

In a 1983 paper the author has established a (decategorified) Satake equivalence for affine Hecke algebras. In this paper we give new proofs for some results of that paper, one based on the theory of J-rings and one based on the known…

Representation Theory · Mathematics 2020-12-11 G. Lusztig

It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been devoted to the algorithmic aspects of the Frequent Itemset…

Databases · Computer Science 2020-01-28 Slimane Oulad-Naoui , Hadda Cherroun , Djelloul Ziadi

In 1973 Paschke defined a factorization for completely positive maps between C*-algebras. In this paper we show that for normal maps between von Neumann algebras, this factorization has a universal property, and coincides with Stinespring's…

Operator Algebras · Mathematics 2017-01-04 Abraham Westerbaan , Bas Westerbaan