António Pereira
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
António Pereira has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Martins da Fonseca
Kuwait College of Science and Technology
2 shared publications - Cristina Requejo
University of Aveiro
2 shared publications - Milica Anđelić
Department of Mathematics, Kuwait University, Al Shadadiyah, Kuwait
2 shared publications R. Rodrigues
2 shared publications- Rosa Figueiredo
Laboratoire Informatique d’Avignon, Avignon Université, Avignon, France
2 shared publications Rosália Rodrigues
University of Aveiro
2 shared publications
Latest Publications
- 20 January 2020
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 36 (36) , 587-598
The interesting spectral interlacing property for a certain tridiagonal matrix
In this paper, a new tridiagonal matrix, whose eigenvalues are the same as the Sylvester-Kac matrix of the same order, is provided. The interest of this matrix relies also in that the spectrum of a principal submatrix is also of a Sylvester-Kac matrix given rise to an interesting spectral interlacing property. It is proved alternatively that the initial matrix is similar to the Sylvester-Kac matrix.
- 20 January 2020
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 36 (36) , 587-598
The interesting spectral interlacing property for a certain tridiagonal matrix
In this paper, a new tridiagonal matrix, whose eigenvalues are the same as the Sylvester-Kac matrix of the same order, is provided. The interest of this matrix relies also in that the spectrum of a principal submatrix is also of a Sylvester-Kac matrix given rise to an interesting spectral interlacing property. It is proved alternatively that the initial matrix is similar to the Sylvester-Kac matrix.
- Open Access
- 1 January 2020
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 18 (1) , 1227-1229
Explicit determinantal formula for a class of banded matrices
In this short note, we provide a brief proof for a recent determinantal formula involving a particular family of banded matrices.
- 1 January 2020
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 18 (1) , 1227-1229
Open AccessExplicit determinantal formula for a class of banded matrices
In this short note, we provide a brief proof for a recent determinantal formula involving a particular family of banded matrices.
- 3 August 2018
- Published by Oxford University Press (OUP) in Microscopy and Microanalysis
- Vol. 25 (1) , 244-249
Morphology and Ontogeny of Statoliths in the Grooved Carpet Shell, Ruditapes decussatus
Statoliths are nonskeletal calcified structures included in most invertebrates’ gravireceptors. They have been identified and characterized in several gastropod and cephalopod molluscs and have proved to be very useful for age estimation, growth studies, and connectivity analysis, among other applications. Beyond the scarce available records on their occurrence in Class Bivalvia, statoliths are yet to be documented in the grooved carpet shell, Ruditapes decussatus, a species of high ecological and commercial value. An easy method for the extraction and processing of R. decussatus statoliths is described herein. The statolith growth was followed from the initial shell length (SL) of 2.5–3.5 mm (seed commercial size T1.5) for a period of 6 months in a nursery facility located in the Ria de Aveiro (an estuarine system in NW Portugal). The relationship between statolith diameter (StD) and SL follows the function StD=14.305 SL0.254 (N=173; r=0.855, p<0.001). All statoliths observed showed similar morphostructure and general chemistry: hard, translucent spheres of crystalline calcium oxalate (whewellite), with a central nucleus delimited by a growth check of 6.7±1.0 µm in diameter, possibly as a result of growth arrest during metamorphosis, a metamorphic ring, as described for their gastropod counterparts. Subsequent studies should validate this and will involve a search for the occurrence of additional checks that may potentially be present in older specimens and if they are, would open a new range of most promising applications for bivalve statoliths.
- 3 August 2018
- Published by Oxford University Press (OUP) in Microscopy and Microanalysis
- Vol. 25 (1) , 244-249
Morphology and Ontogeny of Statoliths in the Grooved Carpet Shell, Ruditapes decussatus
Statoliths are nonskeletal calcified structures included in most invertebrates’ gravireceptors. They have been identified and characterized in several gastropod and cephalopod molluscs and have proved to be very useful for age estimation, growth studies, and connectivity analysis, among other applications. Beyond the scarce available records on their occurrence in Class Bivalvia, statoliths are yet to be documented in the grooved carpet shell, Ruditapes decussatus, a species of high ecological and commercial value. An easy method for the extraction and processing of R. decussatus statoliths is described herein. The statolith growth was followed from the initial shell length (SL) of 2.5–3.5 mm (seed commercial size T1.5) for a period of 6 months in a nursery facility located in the Ria de Aveiro (an estuarine system in NW Portugal). The relationship between statolith diameter (StD) and SL follows the function StD=14.305 SL0.254 (N=173; r=0.855, p<0.001). All statoliths observed showed similar morphostructure and general chemistry: hard, translucent spheres of crystalline calcium oxalate (whewellite), with a central nucleus delimited by a growth check of 6.7±1.0 µm in diameter, possibly as a result of growth arrest during metamorphosis, a metamorphic ring, as described for their gastropod counterparts. Subsequent studies should validate this and will involve a search for the occurrence of additional checks that may potentially be present in older specimens and if they are, would open a new range of most promising applications for bivalve statoliths.
- Open Access
- 1 February 2018
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 6 (1) , 68-76
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching. Furthermore, computational experiments revealed that the introduced lower bound is better than the known ones. The paper also gives sufficient condition for a graph to be non Hamiltonian (or without a perfect matching).
- 1 February 2018
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 6 (1) , 68-76
Open AccessA sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching. Furthermore, computational experiments revealed that the introduced lower bound is better than the known ones. The paper also gives sufficient condition for a graph to be non Hamiltonian (or without a perfect matching).
- Open Access
The $μ$-permanent, a new graph labeling, and a known integer sequence
Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$ is the number of inversions of the permutation $\sigma$ in the symmetric group $S_n$. In this note, motivated by this notion, we discuss a new graph labeling for trees whose matrices satisfy certain $\mu$-permanental identities. We relate the number of labelings of a path with a known integer sequence. Several examples are provided.Open AccessThe $μ$-permanent, a new graph labeling, and a known integer sequence
Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$ is the number of inversions of the permutation $\sigma$ in the symmetric group $S_n$. In this note, motivated by this notion, we discuss a new graph labeling for trees whose matrices satisfy certain $\mu$-permanental identities. We relate the number of labelings of a path with a known integer sequence. Several examples are provided. - 6 April 2016
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (5) , 1023-1040
Feasibility check for the distance geometry problem: an application to molecular conformations
- 6 April 2016
- Published by Wiley in International Transactions in Operational Research
- Vol. 24 (5) , 1023-1040
Feasibility check for the distance geometry problem: an application to molecular conformations
- 1 January 2011
- Published by Inderscience Publishers in International Journal of Mathematical Modelling and Numerical Optimisation
- Vol. 2 (3) , 273
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry
In this work, we propose an approach for a real sequence-dependent batch setup times scheduling problem arising in a pharmaceutical company. A legal obligation for the pharmaceutical industry is to monitor the quality of their products during its life cycle. The development of new pharmaceutical products (medicines) leads to a high number of batches to be tested in order to accomplish with certain regulatory obligations regarding maintaining safeguards on quality and safety. The time lines are critical in this process. The problem is how to manage and schedule a number of tests, that require setups and obey to certain precedence relations, to avoid delays in the answers.
- 1 January 2011
- Published by Inderscience Publishers in International Journal of Mathematical Modelling and Numerical Optimisation
- Vol. 2 (3) , 273
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry
In this work, we propose an approach for a real sequence-dependent batch setup times scheduling problem arising in a pharmaceutical company. A legal obligation for the pharmaceutical industry is to monitor the quality of their products during its life cycle. The development of new pharmaceutical products (medicines) leads to a high number of batches to be tested in order to accomplish with certain regulatory obligations regarding maintaining safeguards on quality and safety. The time lines are critical in this process. The problem is how to manage and schedule a number of tests, that require setups and obey to certain precedence relations, to avoid delays in the answers.
- 5 December 2009
- Published by Elsevier in Statistics & Probability Letters
- Vol. 80 (5-6) , 437-444
Detecting finiteness in the right endpoint of light-tailed distributions
- 5 December 2009
- Published by Elsevier in Statistics & Probability Letters
- Vol. 80 (5-6) , 437-444
Detecting finiteness in the right endpoint of light-tailed distributions
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 454-461
A Symbolic Approach to Quantum Computation Simulation
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 454-461
A Symbolic Approach to Quantum Computation Simulation
- 8 December 2005
- Published by Springer Nature
- p. 280-283
Redundant Quantum Arithmetic