English
Related papers

Related papers: Regular fat linear sets

200 papers

We consider the open problem of determining the graded Betti numbers for fat point subschemes supported at general points of the projective plane. We relate this problem to the open geometric problem of determining the splitting type of the…

Algebraic Geometry · Mathematics 2007-06-19 Alessandro Gimigliano , Brian Harbourne , Monica Idà

Given a fat point scheme $\mathbb{W}=m_1P_1+\cdots+m_sP_s$ in the projective $n$-space $\mathbb{P}^n$ over a field $K$ of characteristic zero, the modules of K\"ahler differential $k$-forms of its homogeneous coordinate ring contain useful…

Algebraic Geometry · Mathematics 2020-08-13 Martin Kreuzer , Tran N. K. Linh , Le Ngoc Long

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Combinatorics · Mathematics 2019-12-19 Jakub Przybyło

Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…

Number Theory · Mathematics 2010-05-21 Norbert Hegyvári , Francois Hennecart , Alain Plagne

We show weighted non-autonomous $L^q(L^p)$ maximal regularity for families of complex second-order systems in divergence form under a mixed regularity condition in space and time. To be more precise, we let $p,q \in (1,\infty)$ and we…

Analysis of PDEs · Mathematics 2025-07-15 Sebastian Bechtel

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

Given a subspace arrangement, there are several De Concini-Procesi models associated to it, depending on distinct sets of initial combinatorial data (building sets). The first goal of this paper is to describe, for the root arrangements of…

Algebraic Topology · Mathematics 2012-10-30 Giovanni Gaiffi , Matteo Serventi

A ($\kappa$,$\tau$)-regular set is a vertex subset S inducing a $\kappa$-regular subgraph such that every vertex out of S has $\tau$ neighbors in S. This article is an expository overview of the main results obtained for graphs with…

Combinatorics · Mathematics 2019-01-01 Domingos M. Cardoso

We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…

Information Theory · Computer Science 2009-04-07 Shachar Lovett

In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…

Combinatorics · Mathematics 2020-05-07 Vito Napolitano , Ferdinando Zullo

We call an element of a finite general linear group $ \textrm{GL}(d,q) $ \emph{fat} if it leaves invariant, and acts irreducibly on, a subspace of dimension greater than $d/2$. Fatness of an element can be decided efficiently in practice by…

Group Theory · Mathematics 2019-03-19 Alice C. Niemeyer , Sabina B. Pannek , Cheryl E. Praeger

The equivalence problem of $\mathbb{F}_q$-linear sets of rank n of $PG(1,q^n)$ is investigated, also in terms of the associated variety, projecting configurations, $\mathbb{F}_q$-linear blocking sets of R\'edei type and MRD-codes.

Combinatorics · Mathematics 2016-07-26 Bence Csajbók , Giuseppe Marino , Olga Polverino

We study the point regular groups of automorphisms of some of the known generalised quadrangles. In particular we determine all point regular groups of automorphisms of the thick classical generalised quadrangles. We also construct point…

Combinatorics · Mathematics 2012-06-26 John Bamberg , Michael Giudici

We discuss a new point of view of representation theory of Lie groupoids and algebroids: fat Lie theory. The category of fat extensions is introduced, as well as the category of abstract $2$-term representations up to homotopy (ruths) --…

Differential Geometry · Mathematics 2026-05-15 Lennart Obster

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Metric Geometry · Mathematics 2009-06-08 Daniel Pellicer , Egon Schulte

We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…

Number Theory · Mathematics 2014-09-03 Igor Szczyrba , Rafal Szczyrba , Martin Burtscher

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

Number Theory · Mathematics 2016-09-07 Pieter Moree

Given a continuous linear cocycle A over a homeomorphism f of a compact metric space X, we investigate its set R of Lyapunov-Perron regular points, that is, the collection of trajectories of f that obey the conclusions of the Multiplicative…

Dynamical Systems · Mathematics 2026-02-18 Jairo Bochi , Yakov Pesin , Omri Sarig

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

Discrete Mathematics · Computer Science 2024-10-15 Parvez Ali , Annmaria Baby , D. Antony Xavier , Theertha Nair A , Haidar Ali , Syed Ajaz K. Kirmani

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang