English
Related papers

Related papers: On pseudo-arcs from normal rational curve and addi…

200 papers

In this paper, we generalize the so called Korchm\'aros--Mazzocca arcs, that is, point sets of size $q+t$ intersecting each line in $0, 2$ or $t$ points in a finite projective plane of order $q$. For $t\neq 2$, this means that each point of…

Combinatorics · Mathematics 2020-08-25 Bence Csajbók , Zsuzsa Weiner

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

Combinatorics · Mathematics 2025-02-20 F. J. Lobillo , Paolo Santonastaso , John Sheekey

In this paper we present and analyze computational results concerning small complete caps in the projective spaces $\mathrm{PG}(N,q)$ of dimension $N=3$ and $N=4$ over the finite field of order $q$. The results have been obtained using…

In a projective plane over a finite field, complete $(k,n)$-arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory. Since almost all known examples are large, the…

Combinatorics · Mathematics 2023-02-21 Gábor Korchmáros , Gábor Péter Nagy , Tamás Szőnyi

A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this…

Combinatorics · Mathematics 2011-10-20 Xin Zhang , Guizhen Liu , Jian-Liang Wu

A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…

Computational Geometry · Computer Science 2024-02-20 Maarten Löffler , Tamara Mchedlidze , David Orden , Josef Tkadlec , Jules Wulms

The cage problem asks for the smallest number $c(k,g)$ of vertices in a $k$-regular graph of girth $g$ and graphs meeting this bound are known as cages. While cages are known to exist for all integers $k \ge 2$ and $g \ge 3$, the exact…

Combinatorics · Mathematics 2018-04-03 John Bamberg , Anurag Bishnoi , Gordon F. Royle

New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…

Information Theory · Computer Science 2025-10-28 Puyin Wang , Wei Liu , Jinquan Luo , Dengxin Zhai

A {\bf strong arc decomposition} of a digraph $D=(V,A)$ is a partition of its arc set $A$ into two sets $A_1,A_2$ such that the digraph $D_i=(V,A_i)$ is strong for $i=1,2$. Bang-Jensen and Yeo (2004) conjectured that there is some $K$ such…

Combinatorics · Mathematics 2023-09-14 Joergen Bang-Jensen , Yun Wang

Existing machine learning frameworks operate over the field of real numbers ($\mathbb{R}$) and learn representations in real (Euclidean or Hilbert) vector spaces (e.g., $\mathbb{R}^d$). Their underlying geometric properties align well with…

Machine Learning · Computer Science 2025-12-30 André F. T. Martins

A fake quadric is a smooth projective surface that has the same rational cohomology as a smooth quadric surface but is not biholomorphic to one. We provide an explicit classification of all irreducible fake quadrics according to the…

Algebraic Geometry · Mathematics 2019-06-04 Benjamin Linowitz , Matthew Stover , John Voight

In this paper it has been verified, by a computer-based proof, that the smallest size of a complete arc is 14 in PG(2,31) and in PG(2,32). Some examples of such arcs are also described.

Combinatorics · Mathematics 2010-05-20 Stefano Marcugini , Alfredo Milani , Fernanda Pambianco

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…

Combinatorics · Mathematics 2026-04-07 Hengfeng Liu , Chunming Tang , Zhengchun Zhou , Dongchun Han , Hao Chen

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…

Information Theory · Computer Science 2007-07-13 Roxana Smarandache , Marcel Wauer

All hyperK\"ahler ALE 4-manifolds with a given non-trivial finite group $\Gamma$ in $SU(2)$ at infinity are parameterized by an open dense subset of a real linear space of dimension $3$rank$\Phi$. Here, $\Phi$ denotes the root system…

Differential Geometry · Mathematics 2025-07-16 Yuanjiu Lyu , Bin Xu

We establish some basic properties of quotients of projective Fra\"iss\'e limits and exhibit some classes of compact metric spaces that are the quotient of a projective Fra\"iss\'e limit of a projective Fra\"iss\'e family in a finite…

Logic · Mathematics 2021-05-24 Gianluca Basso , Riccardo Camerlo

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Combinatorics · Mathematics 2007-05-23 Dragan Marusic , Primoz Sparl

In this paper we derive the generating function of RNA structures with pseudoknots. We enumerate all $k$-noncrossing RNA pseudoknot structures categorized by their maximal sets of mutually intersecting arcs. In addition we enumerate…

Combinatorics · Mathematics 2009-09-29 Emma Y. Jin , Jing Qin , Christian M. Reidys

In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…

Optimization and Control · Mathematics 2024-11-26 Valentin V. Gorokhovik

The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…

Number Theory · Mathematics 2015-05-13 Nicolas Brody , Jordan Schettler
‹ Prev 1 3 4 5 6 7 10 Next ›