Zobrazeno 1 - 10
of 256
pro vyhledávání: '"ALIABADI, MOHSEN"'
The concept of matchings originated in group theory to address a linear algebra problem related to canonical forms for symmetric tensors. In an abelian group $(G,+)$, a matching is a bijection $f: A \to B$ between two finite subsets $A$ and $B$ of $G
Externí odkaz:
http://arxiv.org/abs/2412.04516
Autor:
Aliabadi, Mohsen, Taylor, Peter
A matching from a finite subset $A\subset\mathbb{Z}^n$ to another subset $B\subset\mathbb{Z}^n$ is a bijection $f : A \rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its m
Externí odkaz:
http://arxiv.org/abs/2404.02178
Autor:
Aliabadi, Mohsen, Taylor, Peter
The inquiry into identifying sets of monomials that can be eliminated from a generic homogeneous polynomial via a linear change of coordinates was initiated by E. K. Wakeford. This linear algebra problem prompted C. K. Fan and J. Losonczy to introduc
Externí odkaz:
http://arxiv.org/abs/2402.08008
Autor:
Aliabadi, Mohsen
We present sufficient conditions for the existence of matchings in abelian groups and their linear counterparts. These conditions lead to extensions of existing results in matching theory. Additionally, we classify subsets within abelian groups that
Externí odkaz:
http://arxiv.org/abs/2309.14664
Autor:
Aliabadi, Mohsen, Zerbib, Shira
We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A group $G$ has
Externí odkaz:
http://arxiv.org/abs/2202.07719
The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate and prove li
Externí odkaz:
http://arxiv.org/abs/2107.09029
Autor:
Aliabadi, Mohsen, Filom, Khashayar
A matching from a finite subset $A$ of an abelian group to another subset $B$ is a bijection $f:A\rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its multiplicity function.
Externí odkaz:
http://arxiv.org/abs/2103.11432
Autor:
Aliabadi, Mohsen, Friedland, Shmuel
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\F$ is at most $k$ over the algebraic closure of $\F$, where $k$ is a given positive integer. We estimate the arithmetic complexity o
Externí odkaz:
http://arxiv.org/abs/2002.07151
Autor:
Aliabadi, Mohsen
Given a cyclic group $G$ of order $p^r$, where $p$ is a prime and $r\in\mathbb{N}$. It is well-known that the order of its greatest proper subgroup $\psi(G)$ and the number of its generators $\phi(G)$ satisfy $\psi(G)+\phi(G)=p^r$. In this paper, we
Externí odkaz:
http://arxiv.org/abs/1912.05411
Publikováno v:
In Surface & Coatings Technology 25 February 2023 455
