Zobrazeno 1 - 10
of 2 375
pro vyhledávání: '"Pasotti, A."'
Autor:
Mella, Lorenzo, Pasotti, Anita
In this paper we introduce a new domination problem strongly related to the following one recently proposed by Broe, Chartrand and Zhang. One says that a vertex $v$ of a graph $\Gamma$ labeled with an integer $\ell$ dominates the vertices of $\Gamma$
Externí odkaz:
http://arxiv.org/abs/2410.04782
Autor:
Buratti, Marco, Pasotti, Anita
A $(v,k;r)$ Heffter space is a resolvable $(v_r,b_k)$ configuration whose points form a half-set of an abelian group $G$ and whose blocks are all zero-sum in $G$. It was recently proved that there are infinitely many orders $v$ for which, given any p
Externí odkaz:
http://arxiv.org/abs/2408.12412
Autor:
Buratti, Marco, Pasotti, Anita
The notion of a Heffter array, which received much attention in the last decade, is equivalent to a pair of orthogonal Heffter systems. In this paper we study the existence problem of a set of $r$ mutually orthogonal Heffter systems for any $r$. Such
Externí odkaz:
http://arxiv.org/abs/2401.03940
In this paper we consider the seating couple problem with an even number of seats, which, using graph theory terminology, can be stated as follows. Given a positive even integer $v=2n$ and a list $L$ containing $n$ positive integers not exceeding $n$
Externí odkaz:
http://arxiv.org/abs/2308.16553
In 2015, Archdeacon proposed the notion of Heffter arrays in view of its connection to several other combinatorial objects. In the same paper he also presented the following variant. A weak Heffter array $\mathrm{W}\mathrm{H}(m,n;h,k)$ is an $m \time
Externí odkaz:
http://arxiv.org/abs/2302.10617
In this paper, we disprove a conjecture recently proposed in [L. Almodovar et al., arXiv:2108.00035] on the non-existence of biminimal pots realizing the cube, namely pots with the minimum number of tiles and the minimum number of bond-edge types. In
Externí odkaz:
http://arxiv.org/abs/2210.15295
Autor:
Pasotti, A., Dinitz, J. H.
Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well as in rela
Externí odkaz:
http://arxiv.org/abs/2209.13879
Autor:
Mella, Lorenzo, Pasotti, Anita
Square relative non-zero sum Heffter arrays, denoted by $\mathrm{N}\mathrm{H}_t(n;k)$, have been introduced as a variant of the classical concept of Heffter array. An $\mathrm{N}\mathrm{H}_t(n; k)$ is an $n\times n$ partially filled array with elemen
Externí odkaz:
http://arxiv.org/abs/2205.10164
Autor:
Papait, Andrea, Perini, Giordano, Palmieri, Valentina, Cargnoni, Anna, Vertua, Elsa, Pasotti, Anna, Rosa, Enrico, De Spirito, Marco, Silini, Antonietta Rosa, Papi, Massimiliano, Parolini, Ornella
Publikováno v:
In Biomaterials Advances December 2024 165
Publikováno v:
In Discrete Mathematics November 2024 347(11)