English
Related papers

Related papers: Non-unique factorizations, land surveying and elec…

200 papers

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…

Mathematical Physics · Physics 2026-01-23 Tim Heib , David Edward Bruschi

We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…

Combinatorics · Mathematics 2019-04-30 Patrick De Leenheer

A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…

Group Theory · Mathematics 2020-05-26 Ravil Bildanov , Vadim Goryachenko , Andrey Vasil'ev

Fractional revival, a quantum transport phenomenon critical to entanglement generation in quantum spin networks, generalizes the notion of perfect state transfer on graphs. A Cayley graph $\mathrm{Cay}(G,S)$ is called quasi-abelian if its…

Combinatorics · Mathematics 2025-02-21 Yi Fang , Xueyi Huang , Xiaogang Liu , Xiongfeng Zhan

We prove that the convolution of a selfdecomposable distribution with its background driving law is again selfdecomposable if and only if the background driving law is s-selfdecomposable. We will refer to this as the factorization property…

Probability · Mathematics 2007-05-23 Aleksander M. Iksanov , Zbigniew J. Jurek , Bertram M. Schreiber

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Combinatorics · Mathematics 2024-09-04 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

We consider factorizations $G=XY$ where $G$ is a general group, $X$ and $Y$ are normal subsets of $G$ and any $g\in G$ has a unique representation $g=xy$ with $x\in X$ and $y\in Y$. This definition coincides with the customary and…

Group Theory · Mathematics 2018-10-11 Dan Levy , Attila Maróti

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…

Quantum Algebra · Mathematics 2014-02-26 Óscar Cortadellas , Javier López Peña , Gabriel Navarro

In our previous paper math.QA/0412192 the Cayley-Hamilton identity for the GL(m|n) type quantum matrix algebra was obtained. Here we continue investigation of that identity. We derive it in three alternative forms and, most importantly, we…

Quantum Algebra · Mathematics 2007-05-23 Dimitri Gurevich , Pavel Pyatov , Pavel Saponov

Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\in H(v){4em}\hbox{for every}v\in V(G).$$ Let…

Combinatorics · Mathematics 2013-01-29 Hongliang Lu

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Discrete Mathematics · Computer Science 2018-03-26 Didier Caucal

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

Group Theory · Mathematics 2022-09-16 S. Dolfi , E. Pacifici , L. Sanus

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Probability · Mathematics 2021-02-05 Jonathan Hermon , Sam Olesker-Taylor

We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…

Combinatorics · Mathematics 2022-06-28 Mahdieh Hasheminezhad , Brendan D. McKay

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

Group Theory · Mathematics 2014-02-26 Nick Gill

In this paper, we show that every highly edge-connected graph $G$, under a necessary and sufficient degree condition, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$ with $1\le i\le k$,…

Combinatorics · Mathematics 2024-08-30 Morteza Hasanvand

The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…

Group Theory · Mathematics 2019-03-13 Masato Mimura , Hiroki Sako

We consider the factorization method in the spontaneously broken gauge theories such as the electroweak theory. Using the of\/f-shell $W$-boson density matrix formalism we demonstrate that the factorization conditions are completely under…

High Energy Physics - Phenomenology · Physics 2007-05-23 A. Dobrovolskaya , V. Novikov

We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) $G=(V,E)$ of $n$ vertices. An arborescence $A$ consisting of edges $e_1,\ldots,e_{n-1}$ can be represented as a monomial…

Data Structures and Algorithms · Computer Science 2024-08-06 Matúš Mihalák , Przemysław Uznański , Pencho Yordanov
‹ Prev 1 4 5 6 7 8 10 Next ›