arXiv subjects

Daniel Marinho Pellegrino

Publications and source records attributed to Daniel Marinho Pellegrino.

3 recordsLinked to original sources

arXiv2023

General criteria for a strong notion of lineability

A subset $A$ of a vector space $X$ is called $α$-lineable whenever $A$ contains, except for the null vector, a subspace of dimension $α$. If $X$ has a topology, then $A$ is $α$-spaceable if such subspace can be chosen to be closed. The vast existing literature on these topics has shown that positive results for lineability and spaceability are quite common. Recently, the stricter notions of $\left( α,β\right) $% -lineability/spaceability were introduced as an attempt to shed light to more subtle issues. In this paper, among other results, we prove some general criteria for the notion of $\left( α,β\right) $-spaceability and, as applications, we extend recent results of different authors.

math.FA↗

arXiv2019

Sharp anisotropic Hardy--Littlewood inequality for positive multilinear forms

Using elementary techniques, we prove sharp anisotropic Hardy-Littlewood inequalities for positive multilinear forms. In particular, we recover an inequality proved by F. Bayart in 2018.

math.FA↗

arXiv2018

A Gale-Berlekamp permutation-switching problem in higher dimensions

Let an $n\times n$ array $\left( a_{ij}\right) $ of lights be given, each either on (when $a_{ij}=1$) or off (when $a_{ij}=-1$). For each row and each column there is a switch so that if the switch is pulled ($x_{i}=-1$ for row $i$ and $y_{j}=-1$ for column $j$) all of the lights in that line are switched: on to off or off to on. The unbalancing lights problem (Gale-Berlekamp switching game) consists in maximizing the difference between the lights on and off. We obtain the exact parameters for a generalization of the unbalancing lights problem in higher dimensions.

math.CO↗