SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "AMNE:(NATURAL SCIENCES Mathematics Discrete Mathematics) ;conttype:(scientificother)"

Sökning: AMNE:(NATURAL SCIENCES Mathematics Discrete Mathematics) > Övrigt vetenskapligt/konstnärligt

  • Resultat 1-10 av 270
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • 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 .
  •  
2.
  • 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.
  •  
3.
  • 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.
  •  
4.
  • Samieinia, Shiva, 1978- (författare)
  • Digital Geometry, Combinatorics, and Discrete Optimization
  • 2010
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • This thesis consists of two parts: digital geometry and discrete optimization. In the first part we study the structure of digital straight line segments. We also study digital curves from a combinatorial point of view. In Paper I we study the straightness in the 8-connected plane and in the Khalimsky plane by considering vertical distances and unions of two segments. We show that we can investigate the straightness of Khalimsky arcs by using our knowledge from the 8-connected plane. In Paper II we determine the number of Khalimsky-continuous functions with 2, 3 and 4 points in their codomain. These enumerations yield examples of known sequences as well as new ones. We also study the asymptotic behavior of each of them. In Paper III we study the number of Khalimsky-continuous functions with codomain Z and N. This gives us examples of Schröder and Delannoy numbers. As a byproduct we get some relations between these numbers. In Paper IV we study the number of Khalimsky-continuous functions between two points in a rectangle. Using a generating function we get a recurrence formula yielding this numbers.   In the second part we study an analogue of discrete convexity, namely lateral convexity. In Paper V we define by means of difference operators the class of lateral convexity. The functions have plus infinity in their codomain. For the real-valued functions we need to check the difference operators for a smaller number of points. We study the relation between this class and integral convexity. In Paper VI we study the marginal function of real-valued functions in this class and its generalization. We show that for two points with a certain distance we have a Lipschitz property for the points where the infimum is attained. We show that if a function is in this class, the marginal function is also in the same class.
  •  
5.
  • Aas, Erik, et al. (författare)
  • Limiting directions for random walks in classical affine Weyl groups
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • Let be a finite Weyl group and the corresponding affine Weyl group. A random element of can be obtained as a reduced random walk on the alcoves of . By a theorem of Lam (Ann. Probab. 2015), such a walk almost surely approaches one of many directions. We compute these directions when is , and and the random walk is weighted by Kac and dual Kac labels. This settles Lam's questions for types and in the affirmative and for type in the negative. The main tool is a combinatorial two row model for a totally asymmetric simple exclusion process called the -TASEP, with four parameters. By specializing the parameters in different ways, we obtain TASEPs for each of the Weyl groups mentioned above. Computing certain correlations in these TASEPs gives the desired limiting directions.
  •  
6.
  • Kurujyibwami, Celestin (författare)
  • Admissible transformations and the group classification of Schrödinger equations
  • 2017
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • We study admissible transformations and solve group classification problems for various classes of linear and nonlinear Schrödinger equations with an arbitrary number n of space variables.The aim of the thesis is twofold. The first is the construction of the new theory of uniform seminormalized classes of differential equations and its application to solving group classification problems for these classes. Point transformations connecting two equations (source and target) from the class under study may have special properties of semi-normalization. This makes the group classification of that class using the algebraic method more involved. To extend this method we introduce the new notion of uniformly semi-normalized classes. Various types of uniform semi-normalization are studied: with respect to the corresponding equivalence group, with respect to a proper subgroup of the equivalence group as well as the corresponding types of weak uniform semi-normalization. An important kind of uniform semi-normalization is given by classes of homogeneous linear differential equations, which we call uniform semi-normalization with respect to linear superposition of solutions.The class of linear Schrödinger equations with complex potentials is of this type and its group classification can be effectively carried out within the framework of the uniform semi-normalization. Computing the equivalence groupoid and the equivalence group of this class, we show that it is uniformly seminormalized with respect to linear superposition of solutions. This allow us to apply the version of the algebraic method for uniformly semi-normalized classes and to reduce the group classification of this class to the classification of appropriate subalgebras of its equivalence algebra. To single out the classification cases, integers that are invariant under equivalence transformations are introduced. The complete group classification of linear Schrödinger equations is carried out for the cases n = 1 and n = 2.The second aim is to study group classification problem for classes of generalized nonlinear Schrödinger equations which are not uniformly semi-normalized. We find their equivalence groupoids and their equivalence groups and then conclude whether these classes are normalized or not. The most appealing classes are the class of nonlinear Schrödinger equations with potentials and modular nonlinearities and the class of generalized Schrödinger equations with complex-valued and, in general, coefficients of Laplacian term. Both these classes are not normalized. The first is partitioned into an infinite number of disjoint normalized subclasses of three kinds: logarithmic nonlinearity, power nonlinearity and general modular nonlinearity. The properties of the Lie invariance algebras of equations from each subclass are studied for arbitrary space dimension n, and the complete group classification is carried out for each subclass in dimension (1+2). The second class is successively reduced into subclasses until we reach the subclass of (1+1)-dimensional linear Schrödinger equations with variable mass, which also turns out to be non-normalized. We prove that this class is mapped by a family of point transformations to the class of (1+1)-dimensional linear Schrödinger equations with unique constant mass.
  •  
7.
  • Andrén, Lina J., 1980- (författare)
  • Avoidability by Latin squares of arrays of even order
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • We prove that for any k and any 2k × 2k array A such that no cell in A contains more than   k/2550 symbols, and no symbol occurs more than k/2550 times in any row or column, there is a Latin square such that no 2550cell in the Latin square contains a symbol that occurs in the corresponding cell in A. This proves a conjecture of Häggkvist [8] in the special case of arrays with even side.
  •  
8.
  • Andrén, Lina J., 1980- (författare)
  • Avoidability of random arrays
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • An n×n array that in each cell contains a subset of the symbols 1, . . . , n is avoidable if there exists a Latin square of order n such that no cell in the Latin square contains a symbol which belongs to the set of symbols in the corresponding cell of the array. Some results on deterministic conditions for avoidability of arrays have been found, but here we study the problem of having an array with randomly assigned subsets of C in its cells. This is equivalent to the problem of list-edge-coloring  with randomly assigned lists from the set {1, . . . , n}. We show that an array where each symbol appears in each cell with probability p will be avoidable with very high probability even if p is such that the expected number of symbols forbidden in each cell is slightly higher than what deterministic theorems can prove is avoidable.
  •  
9.
  • Andrén, Lina J., 1980-, et al. (författare)
  • Avoiding arrays of odd order by Latin squares
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • We prove that there exists a constant c such that for each pos- itive integer k every (2k+1)×(2k+1) array A on the symbols 1,...,2k+1 with at most c(2k + 1) symbols in every cell, and each symbol repeated at most c(2k+1) times in every row and column is avoidable; that is, there is a (2k+1)×(2k+1) Latin square S on the symbols 1,...,2k+1 such that for each cell (i, j) in S the symbol in (i, j) does not appear in the corresponding cell in A. This settles the last open case of a conjecture by Häggkvist.
  •  
10.
  • Andrén, Lina J., 1980- (författare)
  • Avoiding (m, m, m)-arrays of order n = 2k
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • An (m, m, m)-array of order n is an n × n array such that each cell is assigned a set of at most m symbols from {1,...,n} such that no symbol occurs more than m times in any row or column. An (m,m,m)- array is called avoidable if there exists a Latin square such that no cell in the Latin square contains a symbol that also belongs to the set assigned to the corresponding cell in the array. We show that there is a constant γ such that if m ≤ γ2k, then any (m,m,m)-array of order 2k is avoidable. Such a constant γ has been conjectured to exist for all n by Häggkvist.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 270
Typ av publikation
annan publikation (101)
doktorsavhandling (53)
licentiatavhandling (35)
rapport (21)
bok (19)
tidskriftsartikel (19)
visa fler...
konferensbidrag (13)
bokkapitel (9)
visa färre...
Typ av innehåll
Författare/redaktör
Mansour, Toufik, 196 ... (22)
Linusson, Svante (10)
Bränden, Petter, 197 ... (9)
Steingrimsson, Einar ... (9)
Markström, Klas (8)
Stokes, Klara (7)
visa fler...
Zhelezov, Dmitrii, 1 ... (6)
Claesson, Anders, 19 ... (6)
Hegarty, Peter, 1971 (6)
Potka, Samu (5)
Andrén, Lina J., 198 ... (5)
Bras-Amorós, Maria (5)
Restadh, Petter (4)
Häggkvist, Roland, P ... (4)
Öhman, Lars-Daniel (4)
Casselgren, Carl Joh ... (4)
Bobylev, Alexander (3)
Agdur, Vilhelm (3)
Lindeberg, Tony, 196 ... (3)
Eriksson, Kimmo, Pro ... (3)
Wagner, Stephan (3)
Jäger, Gerold (3)
Pham, Lan Anh (3)
Nenashev, Gleb (3)
Ehrenborg, Richard (3)
Linusson, Svante, Pr ... (2)
Holmgren, Cecilia (2)
Skerman, Fiona (2)
Turova, Tatyana, Pro ... (2)
Persson, Daniel, 197 ... (2)
Carling, Kenneth (2)
Sulzgruber, Robin (2)
Borgefors, Gunilla (2)
Patriksson, Michael, ... (2)
Strömberg, Ann-Brith ... (2)
Stadler, Peter F. (2)
Amini, Nima (2)
Eriksson, Kimmo, 196 ... (2)
Wästlund, Johan, 197 ... (2)
Bengtsson, Lars, 196 ... (2)
Karlström, Bill, 194 ... (2)
Solus, Liam (2)
Gustafsson, Henrik, ... (2)
Hellmuth, Marc (2)
Burghart, Fabian (2)
Danielsson, Joel (2)
Kiselman, Christer O ... (2)
Khrennikov, Andrei, ... (2)
Freij, Ragnar, 1984 (2)
Gavel, Hillevi, 1964 ... (2)
visa färre...
Lärosäte
Chalmers tekniska högskola (99)
Göteborgs universitet (82)
Uppsala universitet (37)
Umeå universitet (30)
Linköpings universitet (28)
Kungliga Tekniska Högskolan (21)
visa fler...
Stockholms universitet (18)
Linnéuniversitetet (7)
Lunds universitet (6)
Mälardalens universitet (5)
Karlstads universitet (5)
Örebro universitet (2)
Högskolan Dalarna (2)
Luleå tekniska universitet (1)
Malmö universitet (1)
RISE (1)
Blekinge Tekniska Högskola (1)
VTI - Statens väg- och transportforskningsinstitut (1)
visa färre...
Språk
Engelska (255)
Svenska (8)
Esperanto (3)
Spanska (2)
Tyska (1)
Ryska (1)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (270)
Teknik (17)
Samhällsvetenskap (2)
Humaniora (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy