Zobrazeno 1 - 10
of 705
pro vyhledávání: '"López, Alexander"'
Autor:
Akinwande, Mayowa, Lopez, Alexander, Yusuf, Tobi, Unuriode, Austine, Yusuf, Babatunde, Yussuph, Toyyibat, Okoro, Stanley
Publikováno v:
Computer Science & Information Technology (CS & IT), ISSN : 2231 - 5403, Volume 14, Number 04, February 2024
This paper provides a comprehensive examination of the evolution of credit cards in the United States, tracing their historical development, causes, consequences, and impact on both individuals and the economy. It delves into the transformation of cr
Externí odkaz:
http://arxiv.org/abs/2407.11146
Autor:
Diaz-Lopez, Alexander, Ha, Brian, Harris, Pamela E., Rogers, Jonathan, Koss, Theo, Smith, Dorian
If G is a finite connected graph, then an arithmetical structure on $G$ is a pair of vectors $(\mathbf{d}, \mathbf{r})$ with positive integer entries such that $(\diag(\mathbf{d}) - A)\cdot \mathbf{r} = \mathbf{0}$, where $A$ is the adjacency matrix
Externí odkaz:
http://arxiv.org/abs/2406.11183
Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the set of all d
Externí odkaz:
http://arxiv.org/abs/2405.06177
Over the past few years, wildfires have become a worldwide environmental emergency, resulting in substantial harm to natural habitats and playing a part in the acceleration of climate change. Wildfire management methods involve prevention, response,
Externí odkaz:
http://arxiv.org/abs/2403.14657
Let $S_n$ be the symmetric group on the set $\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a peak at index $i$ if $\sigma_{i-1}<\sigma_i>\sigma_{i+1}$. Let $\text{Peak}(\sigma)$ be the set of
Externí odkaz:
http://arxiv.org/abs/2401.10719
Publikováno v:
Class. Quant. Grav. 41, 025007 (2024)
Topological defects in the framework of effective quantum gravity model are investigated, based on the hypothesis of an effective fractal dimension of the universe. This is done by using Caputo fractional derivatives to determine the time-space geome
Externí odkaz:
http://arxiv.org/abs/2309.13934
Let $G$ be a finite, connected graph. An arithmetical structure on $G$ is a pair of positive integer-valued vectors $(\mathbf{d},\mathbf{r})$ such that $(\text{diag}(\mathbf{d})-A_G)\cdot \mathbf{r}=\textbf{0},$ where the entries of $\mathbf{r}$ have
Externí odkaz:
http://arxiv.org/abs/2301.04167
Publikováno v:
Electron. J. Combin. 31 (2024) 1.5
An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group. We show h
Externí odkaz:
http://arxiv.org/abs/2301.02114
Autor:
Behrend, Roger E., Castillo, Federico, Chavez, Anastasia, Diaz-Lopez, Alexander, Escobar, Laura, Harris, Pamela E., Insko, Erik
Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in $\{0,1,\ldots,n\}^m$ whos
Externí odkaz:
http://arxiv.org/abs/2207.14253
Autor:
Diaz-Lopez, Alexander, Louwsma, Joel
Publikováno v:
Linear Algebra Appl. 656 (2023) 324-344
An arithmetical structure on a finite, connected graph without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices, counted wit
Externí odkaz:
http://arxiv.org/abs/2206.14836