Related papers: On scattered linear sets of pseudoregulus type in …
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…
We analyze the embedding dimension of a normal weighted homogeneous surface singularity, and more generally, the Poincar\'e series of the minimal set of generators of the graded algebra of regular functions, provided that the link of the…
We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).
The G230LB grating used with STIS's CCD detector scatters red light. In red objects, the scattered light mingles with the ultraviolet signal, causing spurious short-wavelength flux and weakening absorption features. Recent calibration…
In this paper, we study and characterise the natural embedding of the twisted triality hexagon T(q^3,q) in PG(7,q^3). We begin by describing the possible intersections of subspaces of PG(7,q^3) with T(q^3,q). Then, we provide conditions on…
Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…
Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…
We exhibit new examples of regions of $M\setminus L$ where $M$ and $L$ denote the Markov and Lagrange spectra, respectively. These regions have a different nature from all known regions studied so far: they contain \emph{intruder sets}…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
Given an $n$-vertex graph $G$ with minimum degree at least $d n$ for some fixed $d > 0$, the distribution $G \cup \mathbb{G}(n,p)$ over the supergraphs of $G$ is referred to as a (random) {\sl perturbation} of $G$. We consider the…
Diffusion kernels over graphs have been widely utilized as effective tools in various applications due to their ability to accurately model the flow of information through nodes and edges. However, there is a notable gap in the literature…
Given a smooth complex variety $X$, an algebraically skew embedding of $X$ is an embedding of $X$ into a complex projective space $\mathbb{P}^N$ such that for any two points $x,y\in X$, their embedded tangent spaces in $\mathbb{P}^N$ do not…
In this paper, we investigate the Andr\'e/Bruck-Bose representation of certain $\mathbb{F}_q$-linear sets contained in a line of $\text{PG}(2,q^t)$. We show that scattered $\mathbb{F}_q$-linear sets of rank $3$ in $\text{PG}(1,q^3)$…
We construct the first linear strand of the minimal free resolutions of edge ideals of $d$-partite $d$-uniform clutters. We show that the first linear strand is supported on a relative simplicial complex. In the case that the edge ideals of…
In 1977, Victor Guillemin published a paper discussing geometric scattering theory, in which he related the Lax-Phillips Scattering matrices (associated to a noncompact hyperbolic surface with cusps) and the sojourn times associated to a…
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric…
In this paper a mathematical model is given for the scattering of an incident wave from a surface covered with microscopic small Helmholtz resonators, which are cavities with small openings. More precisely, the surface is built upon a…
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Siegert pseudostates are purely outgoing states at some fixed point expanded over a finite basis. With discretized variables, they provide an accurate description of scattering in the s wave for short-range potentials with few basis states.…