English
Related papers

Related papers: Large point-line matchings and small Nikodym sets

200 papers

We explore the fixed-point structure of QED-like theories upon the inclusion of a Pauli spin-field coupling. We concentrate on the fate of UV-stable fixed points recently discovered in $d=4$ spacetime dimensions upon generalizations to…

High Energy Physics - Theory · Physics 2024-03-06 Holger Gies , Kevin K. K. Tam , Jobst Ziebell

This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets…

Combinatorics · Mathematics 2022-01-07 Vito Napolitano , Olga Polverino , Paolo Santonastaso , Ferdinando Zullo

Broadening existing results in the literature to much wider classes of rings, we prove among other things: 1. Reduced quotients of excellent regular rings of characteristic $p$ admit big test elements, 2. The set of F-jumping numbers of a…

Commutative Algebra · Mathematics 2022-03-07 Neil Epstein

In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and…

Combinatorics · Mathematics 2008-03-31 David Covert , Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

In the first part of the article, a new interesting system of difference equations is introduced. It is developed for re-rating purposes in general insurance. A nonlinear transformation $\varphi $ of a d-dimensional $(d \ge 2)$ Euclidean…

Optimization and Control · Mathematics 2016-02-12 Muhamed Borogovac

We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…

Group Theory · Mathematics 2026-04-01 Tom Hutchcroft , Nicolas Monod , Omer Tamuz

In this article, we study two problems concerning the size of the set of finite point configurations generated by a compact set $E\subset \mathbb{R}^d$. The first problem concerns how the Lebesgue measure or the Hausdorff dimension of the…

Classical Analysis and ODEs · Mathematics 2020-09-30 Yumeng Ou , Krystal Taylor

The first part of this report describes the following result that, logarithmic approximation factor for hard capacitated set cover can be achieved from Wolsey's work [9], using a simpler and more intuitive analysis. We further show in our…

Data Structures and Algorithms · Computer Science 2016-12-12 Rahil Sharma

Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…

General Mathematics · Mathematics 2014-05-14 Zhang Baoshan

We prove that if a subset of $(\mathbb{F}_q^n)^k$ (with $q$ an odd prime power) avoids a full-rank three-point pattern $\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d}$ then it is exponentially small, having size at most $3 \cdot c_q^{nk}$…

Combinatorics · Mathematics 2022-08-31 Mohamed Omar

Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in $\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert x-y \rVert :x,y\in E\}$, where $\lVert \alpha \rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich,…

Combinatorics · Mathematics 2024-06-19 Firdavs Rakhmonov

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

Computational Complexity · Computer Science 2013-05-15 Michael R. Fellows , Bart M. P. Jansen

We prove that if $E \subset {\mathbb F}_q^2$, $q \equiv 3 \mod 4$, has size greater than $Cq^{7/4}$, then $E$ determines a positive proportion of all congruence classes of triangles in ${\mathbb F}_q^2$. The approach in this paper is based…

Combinatorics · Mathematics 2012-01-26 Michael Bennett , Alex Iosevich , Jonathan Pakianathan

In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…

General Topology · Mathematics 2014-12-04 Collins Amburo Agyingi , Yaé Ulrich Gaba

We establish the existence of fixed points for certain gauge theories candidate to be magnetic duals of QCD with one adjoint Weyl fermion. In the perturbative regime of the magnetic theory the existence of a very large number of fixed…

High Energy Physics - Theory · Physics 2011-05-10 Oleg Antipin , Matin Mojaza , Claudio Pica , Francesco Sannino

Asymptotic representation theory of general linear groups GL(n,q) over a finite field leads to studying probability measures \rho on the group U of all infinite uni-uppertriangular matrices over F_q, with the condition that \rho is…

Probability · Mathematics 2015-03-13 Alexey Bufetov , Leonid Petrov

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

Number Theory · Mathematics 2018-01-04 Hugues Randriam

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…

Combinatorics · Mathematics 2015-06-24 Vincent Beck , Cédric Lecouvey

The large-$N$ limit of $O(N)$-symmetric bosonic field theories, or $U(N)$-symmetric fermionic field theories, is amenable to a saddle point approximation. As a result, there is a family of closely related algorithms for efficient lattice…

High Energy Physics - Lattice · Physics 2022-01-03 Scott Lawrence

We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in $r$-regular bipartite graphs. It is shown that some of these bounds are…

Combinatorics · Mathematics 2007-05-23 Shmuel Friedland , Leonid Gurvits