English
Related papers

Related papers: Close-to-regularity and completely regularity of b…

200 papers

We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…

Computational Geometry · Computer Science 2018-09-05 Linda Kleist

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…

Information Theory · Computer Science 2016-01-13 P. J. Almeida , D. Napp , R. Pinto

Completely regular codes with covering radius $\rho=1$ must have minimum distance $d\leq 3$. For $d=3$, such codes are perfect and their parameters are well known. In this paper, the cases $d=1$ and $d=2$ are studied and completely…

Information Theory · Computer Science 2009-06-03 J. Borges J. Rifa V. Zinoviev

We give a necessary and sufficient condition for a one-dimensional regular and Hausdorff topological space definable in a definably complete uniformly locally o-minimal structure of the second kind having definable bounded multiplication…

Logic · Mathematics 2021-11-01 Masato Fujita , Tomohiro Kawakami

The relation between equiangular sets of lines in the real space and distance-regular double covers of the complete graph is well known and studied since the work of Seidel and others in the 70's. The main topic of this paper is to continue…

Combinatorics · Mathematics 2018-05-23 Gabriel Coutinho , Chris Godsil , Mirhamed Shirazi , Harmony Zhan

The purpose of this paper is to study the approximation of vector valued mappings defined on a subset of a normed space. We investigate Korovkin-type conditions under which a given sequence of linear operators becomes a so-called…

Functional Analysis · Mathematics 2007-05-23 Lorenzo D'Ambrosio

We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…

Combinatorics · Mathematics 2013-01-31 Edwin R. van Dam , Gholamreza Omidi

Two immersed triangulations in the plane with the same combinatorics are considered as preimage and image of a discrete immersion $F$. We compare the cross-ratios $Q$ and $q$ of corresponding pairs of adjacent triangles in the two…

Complex Variables · Mathematics 2020-03-02 Ulrike Bücking

This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…

Statistics Theory · Mathematics 2007-08-07 Richard A. Olshen

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

Combinatorics · Mathematics 2014-10-22 K. Dosen , Z. Petric

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

Geometric Topology · Mathematics 2007-05-23 Simon A. King

We show that all the common definitions of quasiregular mappings $f\colon M\to N$ between two equiregular subRiemannian manifolds of homogeneous dimension $Q\geq 2$ are quantitatively equivalent with precise dependences of the…

Differential Geometry · Mathematics 2016-05-04 Chang-Yu Guo , Tony Liimatainen

For each ideal of multilinear mappings $\cal M$ we explicitly construct a corresponding ideal $^{a}{\cal M}$ such that multilinear forms in $^{a}{\cal M}$ are exactly those which can be approximated, in the uniform norm, by multilinear…

Functional Analysis · Mathematics 2008-10-31 Geraldo Botelho , Pablo Galindo , Leonardo Pellegrini

Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…

Probability · Mathematics 2019-01-01 Jiaoyang Huang

In this short note, we give an easy proof of the following result: for $ n\geq 2, $ $\underset{t\to0}{\lim} \,e^{it\Delta }f\left(x+\gamma(t)\right) = f(x) $ almost everywhere whenever $ \gamma $ is an $ \alpha- $H\"older curve with $…

Classical Analysis and ODEs · Mathematics 2024-03-28 Javier Minguillón

We study boundary regularity of maps from two-dimensional domains into manifolds which are critical with respect to a generic conformally invariant variational functional and which, at the boundary, enter perpendicularly into a support…

Analysis of PDEs · Mathematics 2018-02-12 Armin Schikorra

If dividing by $p$ is a mistake, multiply by $q$ and translate, and so you'll live to iterate. We show that if we define a Collatz-like map in this form then, under suitable conditions on $p$ and $q$, almost all orbits of this map attain…

Dynamical Systems · Mathematics 2022-11-22 Felipe Gonçalves , Rachel Greenfeld , Jose Madrid

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Functional Analysis · Mathematics 2023-12-27 Todor Manev

A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if and only if each of its W-components is perfect (respectively,…

Combinatorics · Mathematics 2019-08-26 Sameera M Salam , Daphna Chacko , Nandini J Warrier , K Murali Krishnan , Sudeep K S

Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…

Functional Analysis · Mathematics 2013-09-18 Aurora Fernandez Leon , Adriana Nicolae