A graded subring of an inverse limit of polynomial rings

We study the power series ring R= K[[x1,x2,x3,...]]on countably infinitely many variables, over a field K, and two particular K-subalgebras of it: the ring S, which is isomorphic to an inverse limit of the polynomial rings in finitely many variables over K, and the ring R', which is the largest graded subalgebra of R. Of particular interest are the homogeneous, finitely generated ideals in R', among them the generic ideals. The definition of S as an inverse limit yields a set of truncation homomorphisms from S to K[x1,...,xn] which restrict to R'. We have that the truncation of a generic I in R' is a generic ideal in K[x1,...,xn]. It is shown in Initial ideals of Truncated Homogeneous Ideals that the initial ideal of such an ideal converge to the initial ideal of the corresponding ideal in R'. This initial ideal need no longer be finitely generated, but it is always locally finitely generated: this is proved in Gröbner Bases in R'. We show in Reverse lexicographic initial ideals of generic ideals are finitely generated that the initial ideal of a generic ideal in R' is finitely generated. This contrast to the lexicographic term order. If I in R' is a homogeneous, locally finitely generated ideal, and if we write the Hilbert series of the truncated algebras K[x1,...,xn] module the truncation of I as qn(t)/(1-t)n, then we show in Generalized Hilbert Numerators that the qn's converge to a power series in t which we call the generalized Hilbert numerator of the algebra R'/I. In Gröbner bases for non-homogeneous ideals in R' we show that the calculations of Gröbner bases and initial ideals in R' can be done also for some non-homogeneous ideals, namely those which have an associated homogeneous ideal which is locally finitely generated. The fact that S is an inverse limit of polynomial rings, which are naturally endowed with the discrete topology, provides S with a topology which makes it into a complete Hausdorff topological ring. The ring R', with the subspace topology, is dense in R, and the latter ring is the Cauchy completion of the former. In Topological properties of R' we show that with respect to this topology, locally finitely generated ideals in R'are closed.

Construction of polynomial spline spaces over quadtree and octree T-meshes

[EN]We present a new strategy for constructing tensor product spline spaces over quadtree and octree T-meshes. The proposed technique includes some simple rules for inferring local knot vectors to define spline blending functions. These rules allow to obtain for a given T-mesh a set of cubic spline functions that span a space with nice properties: it can reproduce cubic polynomials, the functions are C2-continuous, linearly independent, and spaces spanned by nested T-meshes are also nested. In order to span spaces with these properties applying the proposed rules, the T-mesh should fulfill the only requirement of being a 0-balanced quadtree or octree. ..

A simple strategy for defining polynomial spline spaces over hierarchical T-meses

[EN]We present a new strategy for constructing spline spaces over hierarchical T-meshes with quad- and octree subdivision scheme. The proposed technique includes some simple rules for inferring local knot vectors to define C 2 -continuous cubic tensor product spline blending functions. Our conjecture is that these rules allow to obtain, for a given T-mesh, a set of linearly independent spline functions with the property that spaces spanned by nested T-meshes are also nested, and therefore, the functions can reproduce cubic polynomials. In order to span spaces with these properties applying the proposed rules, the T-mesh should fulfill the only requirement of being a 0- balanced mesh...

Construction of polynomial spline spaces over quadtree and octree T-meshes

[EN]We present a new strategy for constructing tensor product spline spaces over quadtree and octree T-meshes. The proposed technique includes some simple rules for inferring local knot vectors to define spline blending functions. These rules allow to obtain for a given T-mesh a set of cubic spline functions that span a space with nice properties: it can reproduce cubic polynomials, the functions are C2-continuous, linearly independent, and spaces spanned by nested T-meshes are also nested. In order to span spaces with these properties applying the proposed rules, the T-mesh should fulfill the only requirement of being a 0-balanced quadtree or octree. ..

Tecniche avanzate per l'analisi di sensitività globale: applicazione alla contaminazione delle acque sotterranee.

The thesis is framed within the field of the stochastic approach to flow and transport themes of solutes in natural porous materials. The methodology used to characterise the uncertainty associated with the modular predictions is completely general and can be reproduced in various contexts. The theme of the research includes the following among its main objectives: (a) the development of a Global Sensitivity Analysis on contaminant transport models in the subsoil to research the effects of the uncertainty of the most important parameters; (b) the application of advanced techniques, such as Polynomial Chaos Expansion (PCE), for obtaining surrogate models starting from those which conduct traditionally developed analyses in the context of Monte Carlo simulations, characterised by an often not negligible computational burden; (c) the analyses and the understanding of the key processes at the basis of the transport of solutes in natural porous materials using the aforementioned technical and analysis resources. In the complete picture, the thesis looks at the application of a Continuous Injection transport model of contaminants, of the PCE technique which has already been developed and applied by the thesis supervisors, by way of numerical code, to a Slug Injection model. The methodology was applied to the aforementioned model with original contribution deriving from surrogate models with various degrees of approximation and developing a Global Sensitivity Analysis aimed at the determination of Sobol’ indices.

In defence of modeling simultaneity for a correct approximation of cultural aspects: implications for food consumers studies with latent variables

Dealing with latent constructs (loaded by reflective and congeneric measures) cross-culturally compared means studying how these unobserved variables vary, and/or covary each other, after controlling for possibly disturbing cultural forces. This yields to the so-called ‘measurement invariance’ matter that refers to the extent to which data collected by the same multi-item measurement instrument (i.e., self-reported questionnaire of items underlying common latent constructs) are comparable across different cultural environments. As a matter of fact, it would be unthinkable exploring latent variables heterogeneity (e.g., latent means; latent levels of deviations from the means (i.e., latent variances), latent levels of shared variation from the respective means (i.e., latent covariances), levels of magnitude of structural path coefficients with regard to causal relations among latent variables) across different populations without controlling for cultural bias in the underlying measures. Furthermore, it would be unrealistic to assess this latter correction without using a framework that is able to take into account all these potential cultural biases across populations simultaneously. Since the real world ‘acts’ in a simultaneous way as well. As a consequence, I, as researcher, may want to control for cultural forces hypothesizing they are all acting at the same time throughout groups of comparison and therefore examining if they are inflating or suppressing my new estimations with hierarchical nested constraints on the original estimated parameters. Multi Sample Structural Equation Modeling-based Confirmatory Factor Analysis (MS-SEM-based CFA) still represents a dominant and flexible statistical framework to work out this potential cultural bias in a simultaneous way. With this dissertation I wanted to make an attempt to introduce new viewpoints on measurement invariance handled under covariance-based SEM framework by means of a consumer behavior modeling application on functional food choices.

High precision swept volume approximation with conservative error bounds

In technical design processes in the automotive industry, digital prototypes rapidly gain importance, because they allow for a detection of design errors in early development stages. The technical design process includes the computation of swept volumes for maintainability analysis and clearance checks. The swept volume is very useful, for example, to identify problem areas where a safety distance might not be kept. With the explicit construction of the swept volume an engineer gets evidence on how the shape of components that come too close have to be modified.rnIn this thesis a concept for the approximation of the outer boundary of a swept volume is developed. For safety reasons, it is essential that the approximation is conservative, i.e., that the swept volume is completely enclosed by the approximation. On the other hand, one wishes to approximate the swept volume as precisely as possible. In this work, we will show, that the one-sided Hausdorff distance is the adequate measure for the error of the approximation, when the intended usage is clearance checks, continuous collision detection and maintainability analysis in CAD. We present two implementations that apply the concept and generate a manifold triangle mesh that approximates the outer boundary of a swept volume. Both algorithms are two-phased: a sweeping phase which generates a conservative voxelization of the swept volume, and the actual mesh generation which is based on restricted Delaunay refinement. This approach ensures a high precision of the approximation while respecting conservativeness.rnThe benchmarks for our test are amongst others real world scenarios that come from the automotive industry.rnFurther, we introduce a method to relate parts of an already computed swept volume boundary to those triangles of the generator, that come closest during the sweep. We use this to verify as well as to colorize meshes resulting from our implementations.

The Poincaré polynomial for the Hilbert scheme of points of C^2

Questo lavoro prende in esame lo schema di Hilbert di punti di C^2, il quale viene descritto assieme ad alcune sue proprietà, ad esempio la sua struttura hyper-kahleriana. Lo scopo della tesi è lo studio del polinomio di Poincaré di tale schema di Hilbert: ciò che si ottiene è una espressione del tipo serie di potenze, la quale è un caso particolare di una formula molto più generale, nota con il nome di formula di Goettsche.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )