Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSemialgebraic Splines
52
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in terms of graded modules. We compute the dimension of the space of splines with large degree in two extreme cases when the cell decomposition has a single interior vertex. First, when the forms defining the edges span a two-dimensional space of forms of degree n---then the curves they define meet in n^2 points in the complex projective plane. In the other extreme, the curves have distinct slopes at the vertex and do not simultaneously vanish at any other point. We also study examples of the Hilbert function and polynomial in cases of a single vertex where the curves do not satisfy either of these extremes.
rate research
Read More
We address the question of whether geometric conditions on the given data can be preserved by a solution in (1) the Whitney extension problem, and (2) the Brenner-Fefferman-Hochster-Kollar problem, both for $mathcal C^m$ functions. Our results involve a certain loss of differentiability. Problem (2) concerns the solution of a system of linear equations $A(x)G(x)=F(x)$, where $A$ is a matrix of functions on $mathbb R^n$, and $F$, $G$ are vector-valued functions. Suppose the entries of $A(x)$ are semialgebraic (or, more generally, definable in a suitable o-minimal structure). Then we find $r=r(m)$ such that, if $F(x)$ is definable and the system admits a $mathcal C^r$ solution $G(x)$, then there is a $mathcal C^m$ definable solution. Likewise in problem (1), given a closed definable subset $X$ of $mathbb R^n$, we find $r=r(m)$ such that if $g:Xtomathbb R$ is definable and extends to a $mathcal C^r$ function on $mathbb R^n$, then there is a $mathcal C^m$ definable extension.
This survey paper describes the role of splines in geometry and topology, emphasizing both similarities and differences from the classical treatment of splines. The exposition is non-technical and contains many examples, with references to more thorough treatments of the subject.
The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the problem comprises a dimension $dinmathbb{N}$, a square matrix $Ainmathbb{Q}^{dtimes d}$, and semialgebraic source and target sets $S,Tsubseteq mathbb{R}^d$. The question is whether there exists $xin S$ and $ninmathbb{N}$ such that $A^nx in T$. The main result of this paper is that the Semialgebraic Orbit Problem is decidable for dimension $dleq 3$. Our decision procedure relies on separation bounds for algebraic numbers as well as a classical result of transcendental number theory---Bakers theorem on linear forms in logarithms of algebraic numbers. We moreover argue that our main result represents a natural limit to what can be decided (with respect to reachability) about the orbit of a single matrix. On the one hand, semialgebraic sets are arguably the largest general class of subsets of $mathbb{R}^d$ for which membership is decidable. On the other hand, previous work has shown that in dimension $d=4$, giving a decision procedure for the special case of the Orbit Problem with singleton source set $S$ and polytope target set $T$ would entail major breakthroughs in Diophantine approximation.
Using results obtained from the study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to the revlex term order in the Hilbert scheme of points in $mathbb{P}^n$. In this context, we look inside properties of several types of segment ideals that we define and compare. This study led us to focus our attention also to connections between the shape of generators of Borel ideals and the related Hilbert polynomial, providing an algorithm for computing all saturated Borel ideals with the given Hilbert polynomial.
The main topic of the paper is the construction of various explicit flat families of border bases. To begin with, we cover the punctual Hilbert scheme Hilb^mu(A^n) by border basis schemes and work out the base changes. This enables us to control flat families obtained by linear changes of coordinates. Next we provide an explicit construction of the principal component of the border basis scheme, and we use it to find flat families of maximal dimension at each radical point. Finally, we connect radical points to each other and to the monomial point via explicit flat families on the principal component.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
