Related papers: A computer based classification of caps in PG(4,3)
Graph neural networks have emerged as a promising paradigm for image processing, yet their performance in image classification tasks is hindered by a limited consideration of the underlying structure and relationships among visual entities.…
Fine-grained visual categorization is a classification task for distinguishing categories with high intra-class and small inter-class variance. While global approaches aim at using the whole image for performing the classification,…
2834 inequivalent spreads under the group $\mathrm{P}\Gamma\mathrm{L}(4,8)$. Therefore there are the same number of translation planes of order 64 with kernel containing $\mathrm{GF}(8)$, and we describe various properties of these planes.…
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
Let $m_2(n, q), n \geq 3$, be the maximum size of k for which there exists a complete k-cap in PG(n, q). In this paper the known bounds for $m_2(n, q), n \geq 4$, q even and $q \geq 2048$, will be considerably improved.
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
The maximum scattered linear sets in $PG(1,q^n)$ have been completely classified for $n \le 4$ by Csajb\'ok-Zanella and Lavrauw-Van de Voorde. Here a wide class of linear sets in $PG(1,q^5)$ is studied which depends on two parameters.…
The present paper is devoted to the complete classification of $4$-dimensional complex Poisson algebras, taking into account a classification, up to isomorphism, of the complex commutative associative algebras of dimension $4$, as well as…
I give a very brief non-technical introduction to the intersection of the fields of spin systems and computational complexity. The focus is on spin glasses and their relationship to NP-complete problems.
We perform the analytic classification of plane branches of multiplicity less or equal than four.
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
A complete classification of two-dimensional algebras over algebraically closed fields is provided
In Computer Vision, edge detection is one of the favored approaches for feature and object detection in images since it provides information about their objects boundaries. Other region-based approaches use probabilistic analysis such as…
Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…
We describe equivalence classes of exact indecomposable module categories over a finite graded tensor category. When applied to a pointed fusion category, our results coincide with the ones obtained in [S. Natale, On the equivalence of…
We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
With the rapid advancement of 3D sensing technologies, obtaining 3D shape information of objects has become increasingly convenient. Lidar technology, with its capability to accurately capture the 3D information of objects at long…
We present a polylogarithmic local computation matching algorithm which guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of bounded degree.
It is investigated how graded variants of integral and complete integral closures behave under coarsening functors and under formation of group algebras.