| 1. |
|
|
| 2. |
- Brandes, Julia, et al.
(författare)
-
On generating functions in additive number theory, II: lower-order terms and applications to PDEs
- 2021
-
Ingår i: Mathematische Annalen. - : Springer Science and Business Media LLC. - 0025-5831 .- 1432-1807. ; 379, s. 347-76
-
Tidskriftsartikel (refereegranskat)abstract
- We obtain asymptotics for sums of the form Sigma(p)(n=1) e(alpha(k) n(k) + alpha(1)n), involving lower order main terms. As an application, we show that for almost all alpha(2) is an element of [0, 1) one has sup(alpha 1 is an element of[0,1)) | Sigma(1 <= n <= P) e(alpha(1)(n(3) + n) + alpha(2)n(3))| << P3/4+epsilon, and that in a suitable sense this is best possible. This allows us to improve bounds for the fractal dimension of solutions to the Schrodinger and Airy equations.
|
|
| 3. |
- Fotedar, Sunney, 1989
(författare)
-
Mathematical Multi-Objective Optimization of the Tactical Allocation of Machining Resources in Functional Workshops
- 2023
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- In the aerospace industry, efficient management of machining capacity is crucial to meet the required service levels to customers and to maintain control of the tied-up working capital. We introduce new multi-item , multi-level capacitated resource allocation models with a medium--to--long--term planning horizon. The model refers to functional workshops where costly and/or time- and resource-demanding preparations (or qualifications) are required each time a product needs to be (re)allocated to a machining resource. Our goal is to identify possible product routings through the factory which minimize the maximum excess resource loading above a given loading threshold while incurring as low qualification costs as possible and minimizing the inventory. In Paper I , we propose a new bi-objective mixed-integer (linear) optimization model for the Tactical Resource Allocation Problem (TRAP). We highlight some of the mathematical properties of the TRAP which are utilized to enhance the solution process. In Paper II , we address the uncertainty in the coefficients of one of the objective functions considered in the bi-objective TRAP. We propose a new bi-objective robust efficiency concept and highlight its benefits over existing robust efficiency concepts. In Paper III , we extend the TRAP with an inventory of semi-finished as well as finished parts, resulting in a tri-objective mixed-integer (linear) programming model. We create a criterion space partitioning approach that enables solving sub-problems simultaneously. In Paper IV , using our knowledge from our previous work we embarked upon a task to generalize our findings to develop an approach for any discrete tri-objective optimization problem. The focus is on identifying a representative set of non-dominated points with a pre-defined desired coverage gap .
|
|
| 4. |
- Xia, Jiacheng, 1991
(författare)
-
Vector-valued Eisenstein series of congruence types and their products
- 2019
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Historically, Kohnen and Zagier connected modular forms with period polynomials, and as a consequence of this association concluded that the products of at most two Eisenstein series span all spaces of classical modular forms of level 1. Later Borisov and Gunnells among other authors extended the result to higher levels. We consider this problem for vector-valued modular forms, establish the framework of congruence types and obtain the structure of the space of vector-valued Eisenstein series using tools from representation theory. Based on this development and historic results, we show that the space of vector-valued modular forms of certain weights and any congruence type can be spanned by the invariant vectors of that type tensor at most two Eisenstein series.
|
|
| 5. |
- Strömberg, Ann-Brith, 1961, et al.
(författare)
-
Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
- 2020
-
Ingår i: Numerical Nonsmooth Optimization: State of the Art Algorithms. - Cham : Springer International Publishing. ; , s. 499-547, s. 499-547
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- This chapter presents several solution methodologies for mixed-integer linear optimization, stated as mixed-binary optimization problems, by means of Lagrangian duals, subgradient optimization, cutting-planes, and recovery of primal solutions. It covers Lagrangian duality theory for mixed-binary linear optimization, a problem framework for which ultimate success—in most cases—is hard to accomplish, since strong duality cannot be inferred. First, a simple conditional subgradient optimization method for solving the dual problem is presented. Then, we show how ergodic sequences of Lagrangian subproblem solutions can be computed and used to recover mixed-binary primal solutions. We establish that the ergodic sequences accumulate at solutions to a convexified version of the original mixed-binary optimization problem. We also present a cutting-plane approach to the Lagrangian dual, which amounts to solving the convexified problem by Dantzig–Wolfe decomposition, as well as a two-phase method that benefits from the advantages of both subgradient optimization and Dantzig–Wolfe decomposition. Finally, we describe how the Lagrangian dual approach can be used to find near optimal solutions to mixed-binary optimization problems by utilizing the ergodic sequences in a Lagrangian heuristic, to construct a core problem, as well as to guide the branching in a branch-and-bound method. The chapter is concluded with a section comprising notes, references, historical downturns, and reading tips.
|
|
| 6. |
- Berman, Robert, 1976
(författare)
-
On the strict convexity of the K-energy
- 2019
-
Ingår i: Pure and Applied Mathematics Quarterly. - 1558-8599 .- 1558-8602. ; 15:4, s. 983-999
-
Tidskriftsartikel (refereegranskat)abstract
- Let (X, L) be a polarized projective complex manifold. We show, by a simple toric one-dimensional example, that Mabuchi's K-energy functional on the geodesically complete space of bounded positive (1, 1)-forms in c(1)(L), endowed with the Mabuchi-Donaldson-Semmes metric, is not strictly convex modulo automorphisms. However, under some further assumptions the strict convexity in question does hold in the toric case. This leads to a uniqueness result saying that a finite energy minimizer of the K-energy (which exists on any toric polarized manifold (X, L) which is uniformly K-stable) is uniquely determined modulo automorphisms under the assumption that there exists some minimizer with strictly positive curvature current.
|
|
| 7. |
- Gourevitch, D., et al.
(författare)
-
EULERIANITY OF FOURIER COEFFICIENTS OF AUTOMORPHIC FORMS
- 2021
-
Ingår i: Representation Theory. - : American Mathematical Society (AMS). - 1088-4165. ; 25, s. 481-507
-
Tidskriftsartikel (refereegranskat)abstract
- We study the question of Eulerianity (factorizability) for Fourier coefficients of automorphic forms, and we prove a general transfer theorem that allows one to deduce the Eulerianity of certain coefficients from that of another coefficient. We also establish a `hidden' invariance property of Fourier coefficients. We apply these results to minimal and next-to-minimal automorphic representations, and deduce Eulerianity for a large class of Fourier and Fourier-Jacobi coefficients. In particular, we prove Eulerianity for parabolic Fourier coefficients with characters of maximal rank for a class of Eisenstein series in minimal and next-to-minimal representations of groups of ADE-type that are of interest in string theory.
|
|
| 8. |
- Fotedar, Sunney, 1989, et al.
(författare)
-
A criterion space decomposition approach to generalized tri-objective tactical resource allocation
- 2023
-
Ingår i: Computational Management Science. - : Springer Science and Business Media LLC. - 1619-697X .- 1619-6988. ; 20:1
-
Tidskriftsartikel (refereegranskat)abstract
- We present a tri-objective mixed-integer linear programming model of the tactical resource allocation problem with inventories, called the generalized tactical resource allocation problem (GTRAP). We propose a specialized criterion space decomposition strategy, in which the projected two-dimensional criterion space is partitioned and the corresponding sub-problems are solved in parallel by application of the quadrant shrinking method (QSM) (Boland in Eur J Oper Res 260(3):873–885, 2017) for identifying non-dominated points. To obtain an efficient implementation of the parallel variant of the QSM we suggest some modifications to reduce redundancies. Our approach is tailored for the GTRAP and is shown to have superior computational performance as compared to using the QSM without parallelization when applied to industrial instances.
|
|
| 9. |
- Arkeryd, Leif, 1940, et al.
(författare)
-
On stationary solutions to normal, coplanar discrete Boltzmann equation models
- 2020
-
Ingår i: Communications in Mathematical Sciences. - 1539-6746 .- 1945-0796. ; 18:8, s. 2215-2234
-
Tidskriftsartikel (refereegranskat)abstract
- The paper proves existence of renormalized solutions for a class of velocity-discrete coplanar stationary Boltzmann equations with given indata. The proof is based on the construction of a sequence of approximations with L-1- compactness for the integrated collision frequency and gain term. L-1-compactness of a sequence of approximations is obtained using the Kolmogorov-Riesz theorem and replaces the L-1-compactness of velocity averages in the continuous velocity case, not available when the velocities are discrete.
|
|
| 10. |
- Brandes, Julia, 1986
(författare)
-
The density of rational lines on hypersurfaces: a bihomogeneous perspective
- 2021
-
Ingår i: Monatshefte für Mathematik. - : Springer Science and Business Media LLC. - 1436-5081 .- 0026-9255. ; 195:2, s. 191-231
-
Tidskriftsartikel (refereegranskat)abstract
- Let F be a non-singular homogeneous polynomial of degree d in n variables. We give an asymptotic formula of the pairs of integer points (x, y) with | x| ⩽ X and | y| ⩽ Y which generate a line lying in the hypersurface defined by F, provided that n> 2 d-1d4(d+ 1) (d+ 2). In particular, by restricting to Zariski-open subsets we are able to avoid imposing any conditions on the relative sizes of X and Y.
|
|
