Searcharxiv⌕ Search

arXiv subjects

Nelly Villamizar

Publications and source records attributed to Nelly Villamizar.

At least 19 recordsLinked to original sources

Trivariate Splines on Fans of Hyperplane Arrangements and Koszul Homology

We study the space of splines $\mathcal{S}^{\mathbf{r}}(Σ^\mathscr{A})$ where ${\mathbf{r}}$ denotes a smoothness distribution and $Σ^\mathscr{A}$ is the fan of a central hyperplane arrangement $\mathscr{A}$ in $\mathbb{R}^3$. This is the first step in the analysis of splines on three-dimensional cross-cut partitions, which naturally generalize planar cross-cut partitions. We show that the Hilbert function of $\mathcal{S}^{\mathbf{r}}(Σ^\mathscr{A})$ is bounded by an expression that involves the dimensions of specific Koszul homology modules constructed from the defining equations of the hyperplane arrangement $\mathscr{A}$ and the smoothness distribution function. By exploiting this connection with Koszul homology, we are able to: 1) compute the dimension of the spline space in high degrees, 2) compute all values of the dimension of the spline space if $\mathscr{A}$ is generic with five or fewer hyperplanes, and 3) compute the Hilbert function of the spline space if $\mathscr{A}$ is a generic arrangement with sufficiently many hyperplanes and ${\mathbf{r}}$ is a constant distribution. As an application of our methods, we compute $\dim \mathcal{S}^0_d(Σ^\mathscr{A})$ and $\dim \mathcal{S}^1_d(Σ^\mathscr{A})$ for all values of $d$ when $\mathscr{A}$ is a generic arrangement.

math.CO↗

Time-optimal neural feedback control of nilpotent systems as a binary classification problem

A computational method for the synthesis of time-optimal feedback control laws for linear nilpotent systems is proposed. The method is based on the use of the bang-bang theorem, which leads to a characterization of the time-optimal trajectory as a parameter-dependent polynomial system for the control switching sequence. A deflated Newton's method is then applied to exhaust all the real roots of the polynomial system. The root-finding procedure is informed by the Hermite quadratic form, which provides a sharp estimate on the number of real roots to be found. In the second part of the paper, the polynomial systems are sampled and solved to generate a synthetic dataset for the construction of a time-optimal deep neural network -- interpreted as a binary classifier -- via supervised learning. Numerical tests in integrators of increasing dimension assess the accuracy, robustness, and real-time-control capabilities of the approximate control law.

math.OC↗

Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an invariant-theoretic approach to studying it. The aim is to be able to show that polynomials that distinguish between decks also distinguish between original graphs, thus translating a graph-theoretic problem into an algebraic one.

math.CO↗

Artinian Gorenstein algebras with binomial Macaulay dual generator

This paper initiates a systematic study for key properties of Artinian Gorenstein \(K\)-algebras having binomial Macaulay dual generators. In codimension 3, we demonstrate that all such algebras satisfy the strong Lefschetz property, can be constructed as a doubling of an appropriate 0-dimensional scheme in \(\mathbb{P}^2\), and we provide an explicit characterization of when they form a complete intersection. For arbitrary codimension, we establish sufficient conditions under which the weak Lefschetz property holds and show that these conditions are optimal.

math.AC↗

New families of Artinian Gorenstein algebras with the weak Lefschetz property

We construct new families of Artinian Gorenstein graded $K$-algebras of arbitrary codimension having binomial Macaulay dual generators and satisfying the weak or the strong Lefschetz property. This is a companion paper to \cite{ADFMMSV}, which studies codimension three algebras having binomial Macaulay dual generators in great depth, establishing in particular that they enjoy the strong Lefschetz property.

math.AC↗

A general formulation of reweighted least squares fitting

We present a generalized formulation for reweighted least squares approximations. The goal of this article is twofold: firstly, to prove that the solution of such problem can be expressed as a convex combination of certain interpolants when the solution is sought in any finite-dimensional vector space; secondly, to provide a general strategy to iteratively update the weights according to the approximation error and apply it to the spline fitting problem. In the experiments, we provide numerical examples for the case of polynomials and splines spaces. Subsequently, we evaluate the performance of our fitting scheme for spline curve and surface approximation, including adaptive spline constructions.

math.NA↗

Multivariate polynomial splines on generalized oranges

We consider spaces of multivariate splines defined on a particular type of simplicial partitions that we call (generalized) oranges. Such partitions are composed of a finite number of maximal faces with exactly one shared medial face. We reduce the problem of finding the dimension of splines on oranges to computing dimensions of splines on simpler, lower-dimensional partitions that we call projected oranges. We use both algebraic and Bernstein-Bézier tools.

math.CO↗

An algebraic framework for geometrically continuous splines

Geometrically continuous splines are piecewise polynomial functions defined on a collection of patches which are stitched together through transition maps. They are called $G^{r}$-splines if, after composition with the transition maps, they are continuously differentiable functions to order $r$ on each pair of patches with stitched boundaries. This type of splines has been used to represent smooth shapes with complex topology for which (parametric) spline functions on fixed partitions are not sufficient. In this article, we develop new algebraic tools to analyze $G^r$-spline spaces. We define $G^{r}$-domains and transition maps using an algebraic approach, and establish an algebraic criterion to determine whether a piecewise function is $G^r$-continuous on the given domain. In the proposed framework, we construct a chain complex whose top homology is isomorphic to the $G^{r}$-spline space. This complex generalizes Billera-Schenck-Stillman homological complex used to study parametric splines. Additionally, we show how previous constructions of $G^r$-splines fit into this new algebraic framework, and present an algorithm to construct a bases for $G^r$-spline spaces. We illustrate how our algebraic approach works with concrete examples, and prove a dimension formula for the $G^r$-spline space in terms of invariants to the chain complex. In some special cases, explicit dimension formulas in terms of the degree of splines are also given.

math.NA↗

Algebraic Methods for Supersmooth Spline Spaces

Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation theory, and computer aided geometric design. In this paper we address various challenges arising in the study of splines with enhanced mixed (super-)smoothness conditions at the vertices and across interior faces of the partition. Such supersmoothness can be imposed but can also appear unexpectedly on certain splines depending on the geometry of the underlying polyhedral partition. Using algebraic tools, a generalization of the Billera-Schenck-Stillman complex that includes the effect of additional smoothness constraints leads to a construction which requires the analysis of ideals generated by products of powers of linear forms in several variables. Specializing to the case of planar triangulations, a combinatorial lower bound on the dimension of splines with supersmoothness at the vertices is presented, and we also show that this lower bound gives the exact dimension in high degree. The methods are further illustrated with several examples.

math.AC↗

Completeness characterization of Type-I box splines

We present a completeness characterization of box splines on three-directional triangulations, also called Type-I box spline spaces, based on edge-contact smoothness properties. For any given Type-I box spline, of specific maximum degree and order of global smoothness, our results allow to identify the local linear subspace of polynomials spanned by the box spline translates. We use the global super-smoothness properties of box splines as well as the additional super-smoothness conditions at edges to characterize the spline space spanned by the box spline translates. Subsequently, we prove the completeness of this space space with respect to the local polynomial space induced by the box spline translates. The completeness property allows the construction of hierarchical spaces spanned by the translates of box splines for any polynomial degree on multilevel Type-I grids. We provide a basis for these hierarchical box spline spaces under explicit geometric conditions of the domain.

math.NA↗

A lower bound for the dimension of tetrahedral splines in large degree

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the dimension of the spline space in low degree, we illustrate in several examples considered by Alfeld and Schumaker that our formula may give the exact dimension of the spline space in large enough degree if vertex positions are generic. In contrast, for splines continuously differentiable of order $r>1$, every lower bound in the literature diverges (often significantly) in large degree from the dimension of the spline space in these examples. We derive the bound using commutative and homological algebra.

math.NA↗

A lower bound for splines on tetrahedral vertex stars

A tetrahedral complex all of whose tetrahedra meet at a common vertex is called a \textit{vertex star}. Vertex stars are a natural generalization of planar triangulations, and understanding splines on vertex stars is a crucial step to analyzing trivariate splines. It is particularly difficult to compute the dimension of splines on vertex stars in which the vertex is completely surrounded by tetrahedra -- we call these \textit{closed} vertex stars. A formula due to Alfeld, Neamtu, and Schumaker gives the dimension of $C^r$ splines on closed vertex stars of degree at least $3r+2$. We show that this formula is a lower bound on the dimension of $C^r$ splines of degree at least $(3r+2)/2$. Our proof uses apolarity and the so-called \textit{Waldschmidt constant} of the set of points dual to the interior faces of the vertex star. We also use an argument of Whiteley to show that the only splines of degree at most $(3r+1)/2$ on a generic closed vertex star are global polynomials.

math.CO↗

Dimension of polynomial splines of mixed smoothness on T-meshes

In this paper we study the dimension of splines of mixed smoothness on axis-aligned T-meshes. This is the setting when different orders of smoothness are required across the edges of the mesh. Given a spline space whose dimension is independent of its T-mesh's geometric embedding, we present constructive and sufficient conditions that ensure that the smoothness across a subset of the mesh edges can be reduced while maintaining stability of the dimension. The conditions have a simple geometric interpretation. Examples are presented to show the applicability of the results on both hierarchical and non-hierarchical T-meshes. For hierarchal T-meshes it is shown that mixed smoothness spline spaces that contain the space of PHT-splines (Deng et al., 2008) always have stable dimension.

math.NA↗

Varieties of apolar subschemes of toric surfaces

Powersum varieties, also called varieties of sums of powers, have provided examples of interesting relations between varieties since their first appearance in the 19th century. One of the most useful tools to study them is apolarity, a notion originally related to the action of differential operators on the polynomial ring. In this work we make explicit how one can see apolarity in terms of the Cox ring of a variety. In this way powersum varieties are a special case of varieties of apolar schemes; we explicitely describe examples of such varieties in the case of two toric surfaces, when the Cox ring is particularly well-behaved.

math.AG↗

$G 1$-smooth splines on quad meshes with 4-split macro-patch elements

We analyze the space of differentiable functions on a quad-mesh $\cM$, which are composed of 4-split spline macro-patch elements on each quadrangular face. We describe explicit transition maps across shared edges, that satisfy conditions which ensure that the space of differentiable functions is ample on a quad-mesh of arbitrary topology. These transition maps define a finite dimensional vector space of $G^{1}$ spline functions of bi-degree $\le (k,k)$ on each quadrangular face of $\cM$. We determine the dimension of this space of $G^{1}$ spline functions for $k$ big enough and provide explicit constructions of basis functions attached respectively to vertices, edges and faces. This construction requires the analysis of the module of syzygies of univariate b-spline functions with b-spline function coefficients. New results on their generators and dimensions are provided. Examples of bases of $G^{1}$ splines of small degree for simple topological surfaces are detailed and illustrated by parametric surface constructions.

math.AC↗

Planar Linkages Following a Prescribed Motion

Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a procedure for solving the problem in full generality, but his constructions tend to be extremely complicated. We provide a novel algorithm that produces much simpler linkages, but works only for parametric curves. Our approach is to transform the problem into a factorization task over some noncommutative algebra. We show how to compute such a factorization, and how to use it to construct a linkage tracing a given curve.

cs.SC↗

Geometrically continuous splines for surfaces of arbitrary topology

We analyze the space of geometrically continuous piecewise polynomial functions or splines for quadrangular and triangular patches with arbitrary topology and general rational transition maps. To define these spaces of G 1 spline functions, we introduce the concept of topological surface with gluing data attached to the edges shared by faces. The framework does not require manifold constructions and is general enough to allow non-orientable surfaces. We describe compatibility conditions on the transition maps so that the space of differentiable functions is ample and show that these conditions are necessary and sufficient to construct ample spline spaces. We determine the dimension of the space of G 1 spline functions which are of degree k on triangular pieces and of bi-degree (k, k) on quadrangular pieces, for k big enough. A separability property on the edges is involved to obtain the dimension formula. An explicit construction of basis functions attached respectively to vertices, edges and faces is proposed and examples of bases of G 1 splines of small degree for topological surfaces with boundary and without boundary are detailed.

math.AG↗

Degenerations of real irrational toric varieties

An irrational toric variety X is an analytic subset of the simplex associated to a finite configuration of real vectors. The positive torus acts on X by translation, and we consider limits of sequences of these translations. Our main result identifies all possible Hausdorff limits of translations of X as toric degenerations using elementary methods and the geometry of the secondary fan of the vector configuration. This generalizes work of Garcia-Puente et al., who used algebraic geometry and work of Kapranov, Sturmfels, and Zelevinsky, when the vectors were integral.

math.AG↗