English
Related papers

Related papers: On Kakeya maps with regularity assumptions

200 papers

We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…

Functional Analysis · Mathematics 2025-09-10 Babu G. V. R. , Alemayehu Negash , Sandhya M. L. , Meaza Bogale

We consider $k$-positive linear systems, that is, systems that map the set of vectors with up to $k-1$ sign variations to itself. For $k=1$, this reduces to positive linear systems. It is well-known that stable positive linear time…

Dynamical Systems · Mathematics 2021-02-04 Chengshuai Wu , Michael Margaliot

In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…

Combinatorics · Mathematics 2024-03-12 Tung T. Nguyen , Nguyen Duy Tân

We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the languages to be learned. This abstracts a very universal learning…

A sufficient condition is established for the existence of a solution to the equation $\mathcal{T}(u,\mathcal{C}(u))=u$, by considering a class of Kannan type equicontraction mappings $\mathcal{T}:\mathcal{A}\times…

Functional Analysis · Mathematics 2022-11-22 Subhadip Pal , Ashis Bera , Lakshmi Kanta Dey

In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…

Quantum Physics · Physics 2013-04-16 Haili Zhao , Jinchuan Hou

In a recent breakthrough, Dvir showed that every Kakeya set in $\F^n$ must be of cardinality at least $c_n |\F|^n$ where $c_n \approx 1/n!$. We improve this lower bound to $\beta^n |\F|^n$ for a constant $\beta > 0$. This pins down the…

Combinatorics · Mathematics 2008-08-22 Shubhangi Saraf , Madhu Sudan

In this paper, we discuss positive maps induced by (irreducibly) covariant linear operators for finite groups. The application of group theory methods allows deriving some new results of a different kind. In particular, a family of…

Quantum Physics · Physics 2020-09-07 Piotr Kopszak , Marek Mozrzymas , Michał Studziński

We investigate a two-parameter family of linear maps on matrix algebras, constructed as diagonal perturbations of classical Tomiyama maps. Employing the Choi matrix method alongside block-positivity techniques, we derive explicit necessary…

Rings and Algebras · Mathematics 2026-04-22 Anindita Bera , Bihalan Bhattacharya , Dariusz Chruściński

In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…

Number Theory · Mathematics 2022-12-20 C P Anil Kumar

For any integer $d \geq 1$, we verify the Jacobian Conjecture for a $d$-linear map in two variables. We prove that almost all the coefficients of the formal inverse are in the ideal specified by the Jacobian condition. We find expressions…

Commutative Algebra · Mathematics 2021-11-23 Mario DeFranco

We give hierarchy of one-parameter family F(a,x) of maps of the interval [0,1] with an invariant measure. Using the measure, we calculate Kolmogorov-Sinai entropy, or equivalently Lyapunov characteristic exponent, of these maps…

Chaotic Dynamics · Physics 2009-10-31 M. A. Jafarizadeh , S. Behnia , S. Khorram , H. Naghshara

In this paper, we mainly investigate $K_{1,2}$-structure-connectivity for any connected graph. Let $G$ be a connected graph with $n$ vertices, we show that $\kappa(G; K_{1,2})$ is well-defined if $diam(G)\geq 4$, or $n\equiv 1\pmod 3$, or…

Combinatorics · Mathematics 2024-03-14 Xiao Zhao , Haojie Zheng , Hengzhe Li

We extend the theory of decomposable maps by giving a detailed description of k-positive maps. A relation between transposition and modular theory is established. The structure of positive maps in terms of modular theory (the generalized…

Mathematical Physics · Physics 2016-09-07 Louis E. Labuschagne , Władysław A. Majewski , Marcin Marciniak

Given positive measures $\nu,\mu$ on an arbitrary measurable space $(\Omega, \mathcal F)$, we construct a sequence of finite partitions $(\pi_n)_n$ of $(\Omega, \mathcal F)$ s.t. $$ \sum_{A\in \pi_n: \mu(A)>0} 1_{A} \frac{\nu(A)}{\mu(A)}…

Classical Analysis and ODEs · Mathematics 2019-09-10 Oleksii Mostovyi , Pietro Siorpaes

For integers $k \geq 2$ and $n \geq k+1$, we prove the following: If $n\cdot k$ is even, there is a connected $k$-regular graph on $n$ vertices. If $n\cdot k$ is odd, there is a connected nearly $k$-regular graph on $n$ vertices.

Combinatorics · Mathematics 2018-01-26 Ghurumuruhan Ganesan

This paper presents several new results related to the Kakeya problem. First, we establish a geometric inequality which says that collections of direction-separated tubes (thin neighborhoods of line segments that point in different…

Classical Analysis and ODEs · Mathematics 2023-08-24 Joshua Zahl

This paper considers a kind of generalized measure $\kappa_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ and determines $\kappa_s^{(h)}(S_{n,k})=n+h(k-2)-1$ for $2 \leqslant k \leqslant n-1$ and $0\leqslant h \leqslant…

Combinatorics · Mathematics 2012-04-09 Xiang-Jun Li , Jun-Ming Xu

We study mappings that satisfy the inverse modulus inequality of Poletsky type in a fixed domain. It is shown that, under some additional restrictions, the image of a ball under such mappings contains a fixed ball uniformly over the class.…

Complex Variables · Mathematics 2024-05-28 Evgeny Sevost'yanov , Valery Targonskii

The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…

Data Structures and Algorithms · Computer Science 2025-08-28 Tatsuya Gima , Yasuaki Kobayashi , Yuto Okada