English
Related papers

Related papers: On the linearity of higher-dimensional blocking se…

200 papers

We prove that if the Jacobian Conjecture in two variables is false and (P,Q) is a standard minimal pair, then the Newton polygon HH(P) of P must satisfy several restrictions that had not been found previously. This allows us to discard some…

Commutative Algebra · Mathematics 2017-08-31 Jorge A. Guccione , Juan J. Guccione , Christian Valqui

The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…

Combinatorics · Mathematics 2025-07-08 Albin Jaldevik , Jan Snellman

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…

Functional Analysis · Mathematics 2021-07-13 Steven Heilman

Given partially ordered sets (posets) $(P, \leq_P)$ and $(P', \leq_{P'})$, we say that $P'$ contains a copy of $P$ if for some injective function $f\colon P\rightarrow P'$ and for any $A, B\in P$, $A\leq _P B$ if and only if $f(A)\leq_{P'}…

Combinatorics · Mathematics 2023-07-06 Maria Axenovich , Christian Winter

In this paper we prove the existence of a complete cap of ${\rm PG}(4n+1, q)$ of size $2(q^{2n+1}-1)/(q-1)$, for each prime power $q>2$. It is obtained by projecting two disjoint Veronese varieties of ${\rm PG}(2n^2+3n, q)$ from a suitable…

Combinatorics · Mathematics 2021-06-01 Antonio Cossidente , Bence Csajbók , Giuseppe Marino , Francesco Pavese

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Combinatorics · Mathematics 2009-05-20 Kari Ragnarsson , Bridget Eileen Tenner

Let $E$ be a subset of the affine plane over a finite field $\mathbb{F}_q$. We bound the size of the subgroup of $SL_2(\mathbb{F}_q)$ that preserves $E$. As a consequence, we show that if $E$ has size $\ll q^\alpha$ and is preserved by $\gg…

Combinatorics · Mathematics 2025-04-11 Le Quang Hung , Thang Pham , Kaloyan Slavov

This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…

Combinatorics · Mathematics 2021-06-24 Gianira N. Alfarano , Martino Borello , Alessandro Neri , Alberto Ravagnani

Let $E(k, \ell)$ denote the smallest integer such that any set of at least $E(k, \ell)$ points in the plane, no three on a line, contains either an empty convex polygon with $k$ vertices or an empty pseudo-triangle with $\ell$ vertices. The…

Combinatorics · Mathematics 2012-10-18 Bhaswar B. Bhattacharya , Sandip Das

Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…

Combinatorics · Mathematics 2022-09-07 Daniele Bartoli , Giuseppe Marino , Alessandro Neri

The Ramsey number $R_X(p,q)$ for a class of graphs $X$ is the minimum $n$ such that every graph in $X$ with at least $n$ vertices has either a clique of size $p$ or an independent set of size $q$. We say that Ramsey numbers are linear in…

Combinatorics · Mathematics 2020-12-07 Bogdan Alecu , Aistis Atminas , Vadim Lozin , Viktor Zamaraev

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

Combinatorics · Mathematics 2015-07-21 Xiang-dong Hou , Stephen D. Lappano , Felix Lazebnik

One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An $(a,b)$ elementary trapping set, or simply an ETS where $a$ is the size and $b$ is the number of degree-one…

Information Theory · Computer Science 2018-03-23 Farzane Amirzade , Mohammad-Reza Sadeghi

In this paper, we study the codes $\mathcal C_k(n,q)$ arising from the incidence of points and $k$-spaces in $\text{PG}(n,q)$ over the field $\mathbb F_p$, with $q = p^h$, $p$ prime. We classify all codewords of minimum weight of the dual…

Combinatorics · Mathematics 2026-01-28 Sam Adriaensen

We show that the spectral set conjecture by Fuglede holds in the setting of cyclic groups of order $p^n q$, where $p$, $q$ are distinct primes and $n\geq1$. This means that a subset $E$ of such a group $G$ tiles the group by translation…

Classical Analysis and ODEs · Mathematics 2020-05-04 Romanos-Diogenes Malikiosis , Mihail N. Kolountzakis

The group $PGL(2,q)$ acts $3$-transitively on the projective line $GF(q) \cup \{\infty\}$. Thus, an orbit of its action on the $k$-subsets of the projective line is the block set of a $3$-$(q+1,k,\lambda)$ design. We find the parameters of…

Combinatorics · Mathematics 2024-08-28 Paul Tricot

In this paper we consider the following question. What is the maximum number of pairwise disjoint $k$-spreads which exist in PG(n,q)? We prove that if k+1 divides n+1 and n>k then there exist at least two disjoint k-spreads in PG(n,q) and…

Combinatorics · Mathematics 2013-12-20 Tuvi Etzion

Over the past few years, the codes $\mathcal{C}_{n-1}(n,q)$ arising from the incidence of points and hyperplanes in the projective space $\text{PG}(n,q)$ attracted a lot of attention. In particular, small weight codewords of…

Combinatorics · Mathematics 2022-12-23 Daniele Bartoli , Lins Denaux

We show that for any sufficiently large integer $Q$ and a real $0\leq\lambda\leq\frac34$ there exists a value $c(n,f,J)>0$ such that all strips $L(Q,\lambda)=\{(x,y):|y-f(x)|<Q^{-\lambda}, x\in J=[a,b]\}$ contain at least $c(n, f,…

Number Theory · Mathematics 2017-11-30 V. Bernik , F. Götze , A. Gusakova

We say that a family of permutations $t$-shatters a set if it induces at least $t$ distinct permutations on that set. What is the minimum number $f_k(n,t)$ of permutations of $\{1, \dots, n\}$ that $t$-shatter all subsets of size $k$? For…

Combinatorics · Mathematics 2024-07-09 António Girão , Lukas Michel , Youri Tamitegama
‹ Prev 1 4 5 6 7 8 10 Next ›