Algebraic Geometry Commons^™

Arrangements Of N Planes Resulting In One Bounded Tetrahedral Chamber, Ava Knight

Williams Honors College, Honors Research Projects

This paper investigates the combinatorial geometry of plane arrangements in three-dimensional space, focusing on configurations that produce exactly one bounded tetrahedral chamber. We define T(n) as the number of face-combinatorial equivalence classes of arrangements of n planes in ℝ³ containing exactly one bounded tetrahedral chamber. Known values — T(3) = 0, T(4) = 1, and T(5) = 2 — are established through direct construction, while T(6) remains an open problem. This paper contributes experimental evidence toward resolving T(6) by systematically extending the two valid 5-plane arrangements and verifying, through a plane removal argument, that each yields a valid plane configuration …

Topological Data Analysis Of Weight Spaces In Convolutional Neural Networks, Adam Wagenknecht

Dissertations

Convolutional Neural Networks (CNNs) have become one of the most commonly used tools for performing image classification. Unfortunately, as with most machine learning algorithms, CNNs suffer from a lack of interpretability. CNNs are trained by using a training data set and a loss function to tune a set of parameters known as the layer weights. This tuning process is based on the classical method of gradient descent, but it relies on a strong stochastic component, which makes the weight behavior during training difficult to understand. However, since CNNs are governed largely by the weights that make up each of the …

Sum Of Cubes Of The First N Integers, Obiamaka L. Agu

Electronic Theses, Projects, and Dissertations

In Calculus we learned that 􏰅Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{􏰅n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …

Numerical Solution For Solving Two-Points Boundary Value Problems Using Orthogonal Boubaker Polynomials, Imad Noah Ahmed

Emirates Journal for Engineering Research

In this paper, a new technique for solving boundary value problems (BVPs) is introduced. An orthogonal function for Boubaker polynomial was utilizedand by the aid of Galerkin method the BVP was transformed to a system of linear algebraic equations with unknown coefficients, which can be easily solved to find the approximate result. Some numerical examples were added with illustrations, comparing their results with the exact to show the efficiency and the applicability of the method.

Model Selection And Experimental Design Of Biological Networks With Algebraic Geometry, Anyu Zhang

Mathematics Theses and Dissertations

Model selection based on experimental data is an essential challenge in biological data science. In decades, the volume of biological data from varied sources, including laboratory experiments, field observations, and patient health records has seen an unprecedented increase. Mainly when collecting data is expensive or time-consuming, as it is often in the case with clinical trials and biomolecular experiments, the problem of selecting information-rich data becomes crucial for creating relevant models.

Motivated by certain geometric relationships between data, we partitioned input data sets, especially data sets that correspond to a unique basis, into equivalence classes with the same basis to …

The Neural Ring: Using Algebraic Geometry To Analyze Neural Codes, Nora Youngs

Department of Mathematics: Dissertations, Theses, and Student Research

Neurons in the brain represent external stimuli via neural codes. These codes often arise from stimulus-response maps, associating to each neuron a convex receptive field. An important problem confronted by the brain is to infer properties of a represented stimulus space without knowledge of the receptive fields, using only the intrinsic structure of the neural code. How does the brain do this? To address this question, it is important to determine what stimulus space features can - in principle - be extracted from neural codes. This motivates us to define the neural ring and a related neural ideal, algebraic objects …

Analyzing Fractals, Kara Mesznik

Renée Crown University Honors Thesis Projects - All

For my capstone project, I analyzed fractals. A fractal is a picture that is composed of smaller images of the larger picture. Each smaller picture is self- similar, meaning that each of these smaller pictures is actually the larger image just contracted in size through the use of the Contraction Mapping Theorem and shifted using linear and affine transformations.

Fractals live in something called a metric space. A metric space, denoted (X, d), is a space along with a distance formula used to measure the distance between elements in the space. When producing fractals …

Collected Papers Vol. 1, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.