惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Stack Overflow Blog
Stack Overflow Blog
Vercel News
Vercel News
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
J
Java Code Geeks
M
MIT News - Artificial intelligence
Microsoft Azure Blog
Microsoft Azure Blog
B
Blog RSS Feed
MongoDB | Blog
MongoDB | Blog
G
Google Developers Blog
Engineering at Meta
Engineering at Meta
量子位
S
SegmentFault 最新的问题
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
A
About on SuperTechFans
P
Proofpoint News Feed
Last Week in AI
Last Week in AI
Recent Announcements
Recent Announcements
腾讯CDC
I
InfoQ
F
Fortinet All Blogs
Hugging Face - Blog
Hugging Face - Blog
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
爱范儿
爱范儿

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
$(d,\textbfσ)$-Veronese variety and some applications
Nicola Durante, Giovanni Longobardi, Valentina Pepe · 2021-07-15 · via math.CO updates on arXiv.org

Let $\mathbb{K}$ be the Galois field $\mathbb{F}_{q^t}$ of order $q^t, q=p^e, p$ a prime, $A=\mathrm{Aut}(\mathbb{K})$ be the automorphism group of $\mathbb{K}$ and $\boldsymbolσ=(σ_0,\ldots, σ_{d-1}) \in A^d$, $d \geq 1$. In this paper the following generalization of the Veronese map is studied: $$ ν_{d,\boldsymbolσ} : \langle v\rangle \in \mathrm{PG}(n-1,\mathbb{K}) \longrightarrow \langle v^{σ_0} \otimes v^{σ_1} \otimes \cdots \otimes v^{σ_{d-1}}\rangle \in \mathrm{PG} (n^d-1,\mathbb{K} ). $$ Its image will be called the $(d,\boldsymbolσ)$-$Veronese$ $variety$ $\mathcal{V}_{d,\boldsymbolσ}$. Here, we will show that $\mathcal{V}_{d,\boldsymbolσ}$ is the Grassmann embedding of a normal rational scroll and any $d+1$ points of it are linearly independent. We give a characterization of $d+2$ linearly dependent points of $\mathcal{V}_{d,\boldsymbolσ}$ and for some choices of parameters, $\mathcal{V}_{p,\boldsymbolσ}$ is the normal rational curve; for $p=2$, it can be the Segre's arc of $\mathrm{PG}(3,q^t)$; for $p=3$ $\mathcal{V}_{p,\boldsymbolσ}$ can be also a $|\mathcal{V}_{p,\boldsymbolσ}|$-track of $\mathrm{PG}(5,q^t)$. Finally, investigate the link between such points sets and a linear code $\mathcal{C}_{d,\boldsymbolσ}$ that can be associated to the variety, obtaining examples of MDS and almost MDS codes.