メインナビゲーションにスキップ
検索にスキップ
メインコンテンツにスキップ
Keio University ホーム
ヘルプ&FAQ
English
日本語
ホーム
プロファイル
研究部門
研究成果
専門知識、名前、または所属機関で検索
数理科学科
学部
理工学部
概要
フィンガープリント
ネットワーク
プロファイル
(25)
研究成果
(538)
フィンガープリント
数理科学科が活動している研究トピックを掘り下げます。これらのトピックラベルは、この組織のメンバーの研究成果に基づきます。これらがまとまってユニークなフィンガープリントを構成します。
並べ替え順
重み付け
アルファベット順
Mathematics
Edge
100%
Connected Graph
93%
Free Graph
87%
Polynomial Time
72%
Integer
61%
Gaussian Distribution
51%
Induced Subgraph
50%
Solvability
43%
Spanning Tree
42%
Hamiltonian Cycle
41%
Positive Integer
40%
Hard Wall
40%
C-Algebras
39%
Perfect Matchings
39%
Meromorphic Function
36%
Convex Function
36%
Numerical Experiment
33%
Lagrangian
32%
Error Estimate
32%
Polynomial
32%
Convex Set
31%
Probability Theory
31%
Weak Solution
30%
Polylogarithm
29%
Chromatic Number
29%
Stochastic Differential Equation
29%
Maximum Degree
28%
Lattices
27%
Residuals
26%
Asymptotic Behavior
23%
Hamiltonian
23%
Edge-Connectivity
23%
Closed Surface
23%
Brownian Motion
23%
Stochastics
23%
Sufficient Condition
22%
Fibration
21%
Concave Function
21%
Large Deviation Principle
21%
Algebraic Number
21%
Manifold
21%
Equilibrium Measure
21%
Asymptotics
21%
Planar Graph
21%
Counterexample
20%
Dimensional Lattice
18%
Initial-Boundary Value Problem
18%
Gaussian Field
18%
Real Field
18%
Elliptic Curve
18%
Continued Fraction
18%
Initial-Value Problem
18%
Markov Shift
17%
Approximates
17%
Logarithmic Derivative
16%
Dimensional Case
16%
Strong Solution
16%
Numerical Example
16%
Diagonal
15%
Critical Point
15%
Particle System
15%
Isotopy
15%
positive number δ
14%
Bipartite Graph
14%
Covering Number
14%
Matching Problem
14%
Stronger Version
14%
Range Interaction
14%
Minimizes
14%
Systems of Linear Equation
14%
Cardinality
14%
Extension of a Group
14%
Skew Product
14%
Nonexistence
14%
Type Equation
14%
Liouville Type
14%
Plane Graph
14%
Base Point
14%
Tie Breaking
14%
Feature Vector
14%
Power Series
14%
Point Theorem
14%
Marginals
14%
Mathematical Analysis
14%
Random Walk
14%
Isomorphism Class
13%
Rate Function
13%
Convex Analysis
13%
Viscosity Solution
12%
Annihilator
12%
weighted graph
12%
Open Problem
12%
Multifractal
12%
Equivariant
11%
Upper Bound
11%
Greedy Algorithm
10%
Terminal Vertex
10%
Convergent Series
10%
Complex Structure
10%
Complexity Space
10%
Keyphrases
Minimum Degree
42%
Fibonacci numbers
40%
Reciprocal Sum
36%
Algebraic Independence
36%
Allocation Mechanism
26%
Algebraic Relations
25%
Painlevé Equations
25%
Connected Graph
25%
Knapsack Constraint
21%
Monotone Submodular Functions
21%
Streaming Algorithms
21%
Class Group
21%
Approximation Algorithms
21%
Induced Subgraph
21%
Distributional Constraints
21%
Integrally Convex Function
21%
Closed Surface
19%
Matroid
18%
3-connected Graph
18%
In(III)
17%
Spanning Tree
16%
Perfect Matching
16%
Polynomial-time Algorithm
15%
Spectral Aspect
14%
Vortex Filament
14%
Intersecting Family
14%
Regular Factor
14%
Envy-freeness
14%
Abelian number Fields
14%
Stickelberger Ideal
14%
Logarithmic Solution
14%
Large Deviation Principle
14%
Algebraic numbers
14%
Utility Function
14%
Concave Utility
14%
Truthful Mechanism
14%
Independence Property
14%
Hamiltonian Cycle
14%
Center Problem
14%
Countable Markov Shift
14%
Branching Problem
14%
Meromorphic Function
14%
Vertex-disjoint Cycles
14%
3-coloring
14%
Plane Triangulation
14%
Midpoint Convexity
14%
Minor-free Graphs
14%
Multi-unit
14%
Market Pricing
14%
Shan
14%
Subsidies
14%
Forbidden Induced Subgraphs
14%
GMRES(m)
14%
Non-orientable
14%
Dehn Twist
14%
Diagonal Transformation
14%
Endowment
14%
Contact 3-manifolds
14%
Elephant Random Walk
14%
Envy-free Matchings
14%
Vertex-disjoint
14%
Positive Integer
14%
Quadrangulation
13%
Asymptotic Behavior
13%
3-connected
12%
Covering number
12%
Indivisible Goods
12%
Mahler's Method
12%
J-graph
12%
Isotopy
11%
Polynomial Time
11%
GMRES Algorithm
10%
Triangulation
10%
Memory Space
10%
Backward Continued Fraction
10%
Small Fraction
10%
NP-hard
10%
Knapsack
10%
Primary Memory
10%
Fitting Ideals
10%
Path Graph
10%
Binary Recurrences
10%
Linear Recurrence Relation
10%
Integer Sequences
10%
M-convex
10%
Maximum Weight
9%
Independence Results
9%
Lucas numbers
9%
CM Fields
9%
B-matching
9%
Independence Relations
9%
M Method
9%
Lyapunov Exponent
9%
Minimum Degree Sum
9%
Competitive Ratio
9%
Bipartite Graph
9%
Efficient Allocation
9%
Edge-connectivity
9%
Fenchel Duality
9%
De Rham
9%