English
Related papers

Related papers: On the equivalence of linear sets

200 papers

Let $\Gamma$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{\theta^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix…

Combinatorics · Mathematics 2025-03-05 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

Let $(\Omega,\mathcal{F},P)$ be a probability space and $\mathcal{N}$ the class of those $F\in\mathcal{F}$ satisfying $P(F)\in\{0,1\}$. For each $\mathcal{G}\subset\mathcal{F}$, define $\overline{\mathcal{G}}=\sigma(\mathcal{G}\cup\mathcal…

Probability · Mathematics 2009-01-20 Patrizia Berti , Luca Pratelli , Pietro Rigo

We show that, if a $n$-vertex triangulation $T$ of maximum degree $\Delta$ has a dual that contains a cycle of length $\ell$, then $T$ has a non-crossing straight-line drawing in which some \emph{collinear set} of $\Omega(\ell/\Delta^4)$…

Combinatorics · Mathematics 2020-09-07 Vida Dujmović , Pat Morin

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…

Metric Geometry · Mathematics 2014-02-25 Xiaomin Chen , Guangda Huzhang , Peihan Miao , Kuan Yang

We prove that if $n >k^2$ then a $k$-dimensional linear code of length $n$ over ${\mathbb F}_{q^2}$ has a truncation which is linearly equivalent to a Hermitian self-orthogonal linear code. In the contrary case we prove that truncations of…

Information Theory · Computer Science 2021-08-19 Simeon Ball , Ricard Vilar

A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…

Combinatorics · Mathematics 2025-03-25 Kai Yuan , Qi Wang , Rongquan Feng , Yan Wang

The equivalence principle is treated on a mathematically rigorous base on sufficiently general subsets of a differentiable manifold. This is carried out using the basis of derivations of the tensor algebra over that manifold. Necessary…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Bozhidar Z. Iliev

A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…

Logic · Mathematics 2020-01-23 Nikolay Bazhenov , Luca San Mauro

We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of these conditions, we provide a unified global…

Optimization and Control · Mathematics 2021-06-08 Roberto Andreani , Gabriel Haeser , Leonardo M. Mito , Héctor Ramírez C

Given a collection of $t$ subspaces in an $n$-dimensional $\mathbb{K} $-vector space $W$ we can associate to them $t$ vanishing ideals in the symmetric algebra $\mathcal{S}(W^*) = \mathbb{K}[x_1,x_2,\dots,x_n]$. As a subspace is defined by…

Commutative Algebra · Mathematics 2019-06-25 Francesca Gandini

It is shown that a superconformal surface with arbitrary codimension in flat Euclidean space has a (necessarily unique) dual superconformal surface if and only if the surface is S-Willmore, the latter a well-known necessary condition to…

Differential Geometry · Mathematics 2014-01-08 Marcos Dajczer , Theodoros Vlachos

As is well known, one can arrange the parameters of the O(N) non-linear sigma model to reproduce the low energy S-matrix elements of the renormalizable O(N) linear sigma model. In this note we provide details which are necessary in order to…

High Energy Physics - Theory · Physics 2009-10-30 Hidenori Sonoda

An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…

Discrete Mathematics · Computer Science 2025-05-20 Takasugu Shigenobu , Naoyuki Kamiyama

While the equality of differential signatures (Calabi et al, Int. J. Comput. Vis. 26: 107-135, 1998) is known to be a necessary condition for congruence, it is not sufficient (Musso and Nicolodi, J. Math Imaging Vis. 35: 68-85, 2009).…

Differential Geometry · Mathematics 2021-07-23 Eric Geiger , Irina A. Kogan

Polynomial $n\times n$ matrices $A(\lambda)$ and $B(\lambda)$ over a field $\mathbb F $ are called semi-scalar equivalent if there exist a nonsingular $n\times n$ matrix $P$ over the field $\mathbb F $ and an invertible $n\times n$ matrix…

Commutative Algebra · Mathematics 2020-03-12 V. M. Prokip

Let $\gamma:[0,1]\rightarrow \mathbb{S}^{2}$ be a non-degenerate curve in $\mathbb{R}^3$, that is to say, $\det\big(\gamma(\theta),\gamma'(\theta),\gamma''(\theta)\big)\neq 0$. For each $\theta\in[0,1]$, let…

Classical Analysis and ODEs · Mathematics 2022-10-05 Shengwen Gan , Larry Guth , Dominique Maldague

A {\it Cameron -- Liebler line class} ${\cal L}$ with parameter $x$ is a set of lines of projective geometry $PG(3,q)$ such that each line of ${\cal L}$ meets exactly $x(q+1)+q^2-1$ lines of ${\cal L}$ and each line that is not from ${\cal…

Combinatorics · Mathematics 2012-08-29 Alexander L. Gavrilyuk , Ivan Y. Mogilnykh

We show that the conditions imposed on a second order linear differential equation with rational coefficients on the complex line by requiring it to have regular singularities with fixed exponents at the points of a finite set $P$ and…

Algebraic Geometry · Mathematics 2016-08-09 Szilard Szabo

In [2] and [19] are presented the first two families of maximum scattered $\mathbb{F}_q$-linear sets of the projective line $\mathrm{PG}(1,q^n)$. More recently in [23] and in [5], new examples of maximum scattered $\mathbb{F}_q$-subspaces…

Combinatorics · Mathematics 2017-09-05 Bence Csajbók , Giuseppe Marino , Ferdinando Zullo

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

Combinatorics · Mathematics 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong
‹ Prev 1 3 4 5 6 7 10 Next ›