English
Related papers

Related papers: Semiarcs with long secants

200 papers

We enumerate height-restricted path diagrams associated with $q$-tangent and $q$-secant numbers by considering convergents of continued fractions, leading to expressions involving basic hypergeometric functions. Our work generalises some…

Combinatorics · Mathematics 2019-07-10 Anum Khalid , Thomas Prellberg

The classification of all semiovals and blocking semiovals in $\mathrm{PG}(2,8)$ and in $\mathrm{PG}(2,9)$ of size less than $17$ is determined. Also, some information on the stabilizer groups and the intersection sizes with lines is given.

Combinatorics · Mathematics 2013-12-10 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Number Theory · Mathematics 2026-04-17 Gal Binyamini , Noriko Hirata-Kohno , Makoto Kawashima , Yuval Salant

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be \emph{cross-$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects…

Combinatorics · Mathematics 2013-12-12 Peter Borg

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

This paper completes the classification of nets of conics containing at least one double line in $\mathrm{PG}(2,q)$ for $q$ even. This classification contributes to the classification of partially symmetric tensors in $\mathbb{F}_q^3…

Combinatorics · Mathematics 2025-09-11 Nour Alnajjarine , Michel Lavrauw

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

alg-geom · Mathematics 2008-02-03 David B. Jaffe

We study complementary information set codes of length $tn$ and dimension $n$ of order $t$ called ($t-$CIS code for short). Quasi-cyclic and quasi-twisted $t$-CIS codes are enumerated by using their concatenated structure. Asymptotic…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Hatoon Shoaib , Patrick Solé

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…

Rings and Algebras · Mathematics 2022-05-04 Victoria Gould , Georgia Schneider

A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…

Information Theory · Computer Science 2016-02-16 F. Shirani , M. Heidari , S. S. Pradhan

In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…

Algebraic Geometry · Mathematics 2011-11-10 Michael Kettner

$t$-spanners are used to approximate the pairwise distances between a set of points in a metric space. They have only a few edges compared to the total number of pairs and they provide a $t$-approximation on the distance of any two…

Computational Geometry · Computer Science 2021-04-29 David Eppstein , Hadi Khodabandeh

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

Combinatorics · Mathematics 2021-11-19 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Yacong Zhou

Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…

Combinatorics · Mathematics 2025-03-05 Martin Ehler

Many extensions to the Standard Model predict gauge interactions with enhanced couplings to third generation quarks, especially the extremely heavy top quark\cite{theoretical}. These phenomena can lead to resonances in the production of…

High Energy Physics - Experiment · Physics 2014-12-01 Anne-Laure Pequegnot

For $t \in [-1, 1)$, a set of points on the $(n-1)$-dimensional unit sphere is called $t$-almost equiangular if among any three distinct points there is a pair with inner product $t$. We propose a semidefinite programming upper bound for…

Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…

Data Structures and Algorithms · Computer Science 2020-11-05 Patrizio Angelini , Giordano Da Lozzo , Giuseppe Di Battista , Fabrizio Frati , Maurizio Patrignani

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

Combinatorics · Mathematics 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

Let $\k$ be a characteristic zero PID, $S$ be a $\k$-algebra and $T\subseteq S$ be a full rank subalgebra. Suppose the algebra $T$ is symmetric. It is important to know when $T$ is a {\em maximal symmetric subalgebra} of $S$, i.e. no…

Representation Theory · Mathematics 2024-11-06 Alexander Kleshchev

In this paper we provide characterizing properties of TDI systems, among others the following: a system of linear inequalities is TDI if and only if its coefficient vectors form a Hilbert basis, and there exists a test-set for the system's…

Optimization and Control · Mathematics 2008-03-17 Edwin O'Shea , Andras Sebo