Results 51 to 60 of about 1,232 (194)
Hyperplane Arrangements over the Ring of Integers Modulo N. [PDF]
, 2023 Let V be a finite vector space of dimension n over the field K. A hyperplane in V is an n − 1 dimensional subspace of V defined by an equation of the form∑ni=1 aixi = 0, ai ∈ K, (x1, ..., xn) ∈ V .
Obeahon, Ehiareshan James
core +2 more sources
Noncrossing partitions and the shard intersection order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We define a new lattice structure (W,\preceq ) on the elements of a finite Coxeter group W. This lattice, called the \emphshard intersection order, is weaker than the weak order and has the noncrossing partition lattice \NC (W) as a sublattice.
Nathan Reading
doaj +1 more source
On Three Ehrhart Theories & Simplicial Hyperplane Arrangements [PDF]
, 2022 This dissertation presents recent contributions to two major topics in discrete geometry: Ehrhart theory and hyperplane arrangements. In Chapter 1, which is part of joint work with Donghyun Kim and Mariel Supina, we investigate equivariant Ehrhart theory,
Elia, Sophia
core +1 more source
Freeness of Signed Graphic Arrangements
AxiomsFreeness occupies an important position in the study of hyperplane arrangements. In this paper, we conclude the freeness of three special classes of signed graphic arrangements based on the addition–deletion theorem and Abe’s free path theory.
Zhaoting Ju, Guangfeng Jiang, Weili Guo
doaj +1 more source
Hyperplane arrangements associated to symplectic quotient singularities [PDF]
, 2018 We study the hyperplane arrangements associated, via the minimal model programme, to symplectic quotient singularities. We show that this hyperplane arrangement equals the arrangement of CM-hyperplanes coming from the representation theory of restricted ...
Schedler, Travis +2 more
core +1 more source
Face Counting for Topological Hyperplane Arrangements [PDF]
, 2023 Determining the number of pieces after cutting a cake is a classical problem. Roberts (1887) provided an exact solution by computing the number of chambers contained in a plane cut by lines.
Randriamaro, Hery
core +1 more source
Advanced Intelligent Discovery, EarlyView.Electrospinning allows the fabrication of fibrous 3D cotton‐wool‐like scaffolds for tissue engineering. Optimizing this process traditionally relies on trial‐and‐error approaches, and artificial intelligence (AI)‐based tools can support it, with the prediction of fiber properties. This work uses machine learning to classify and predict the structure of
Paolo D’Elia +3 more
wiley +1 more source
Toral Arrangements and Hyperplane Arrangements
Rocky Mountain Journal of Mathematics, 1998 The author defines a toral arrangement to be a finite set \({\mathcal A}\) of characters of an algebraic torus \(T\). Such a set corresponds to an integral hyperplane arrangement \(d{\mathcal A}\) in the Lie algebra of the torus given by the kernels of the derivatives of the characters.
openaire +2 more sources
A blowup algebra for hyperplane arrangements [PDF]
Algebra & Number Theory, 2018 22 ...
Garrousian, Mehdi +2 more
openaire +4 more sources
Biotechnology and Bioengineering, EarlyView.ABSTRACT There is a growing demand in the pharmaceutical industry to optimize analytical methodologies, reducing time and resource consumption while ensuring rapid process development and cost‐efficient manufacturing. Indeed, Food and Drug Administration (FDA) introduced the Process Analytical Technology (PAT) as an initiative enabling manufacturers to
Samuele Fiorenza +5 more
wiley +1 more source