Matches in SemOpenAlex for { <https://semopenalex.org/work/W3214070287> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W3214070287 abstract "Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of degree at most the degree of the group as an algebraic variety. However, the degree of a linear algebraic group <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper G subset-of upper G upper L Subscript n Baseline left-parenthesis upper C right-parenthesis> <mml:semantics> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>⊂<!-- ⊂ --></mml:mo> <mml:msub> <mml:mi>GL</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo><!-- --></mml:mo> <mml:mo stretchy=false>(</mml:mo> <mml:mi>C</mml:mi> <mml:mo stretchy=false>)</mml:mo> </mml:mrow> <mml:annotation encoding=application/x-tex>G subset operatorname {GL}_n(C)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> can be arbitrarily large even for <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=n equals 1> <mml:semantics> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding=application/x-tex>n = 1</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. One of the key ingredients of Hrushovski’s algorithm for computing the Galois group of a linear differential equation was an idea to “approximate” every algebraic subgroup of <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper G upper L Subscript n Baseline left-parenthesis upper C right-parenthesis> <mml:semantics> <mml:mrow> <mml:msub> <mml:mi>GL</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo><!-- --></mml:mo> <mml:mo stretchy=false>(</mml:mo> <mml:mi>C</mml:mi> <mml:mo stretchy=false>)</mml:mo> </mml:mrow> <mml:annotation encoding=application/x-tex>operatorname {GL}_n(C)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> by a “similar” group so that the degree of the latter is bounded uniformly in <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=n> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding=application/x-tex>n</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. Making this uniform bound computationally feasible is crucial for making the algorithm practical. In this paper, we derive a single-exponential degree bound for such an approximation (we call it a <italic>toric envelope</italic>), which is qualitatively optimal. As an application, we improve the quintuply exponential bound due to Feng for the first step of Hrushovski’s algorithm to a single-exponential bound. For the cases <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=n equals 2 comma 3> <mml:semantics> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> <mml:annotation encoding=application/x-tex>n = 2, 3</mml:annotation> </mml:semantics> </mml:math> </inline-formula> often arising in practice, we further refine our general bound." @default.
- W3214070287 created "2021-11-22" @default.
- W3214070287 creator A5012130065 @default.
- W3214070287 creator A5030824619 @default.
- W3214070287 creator A5070142343 @default.
- W3214070287 date "2021-10-28" @default.
- W3214070287 modified "2023-10-15" @default.
- W3214070287 title "Degree bound for toric envelope of a linear algebraic group" @default.
- W3214070287 cites W1503569487 @default.
- W3214070287 cites W1541350594 @default.
- W3214070287 cites W1560726565 @default.
- W3214070287 cites W1666394328 @default.
- W3214070287 cites W1973360680 @default.
- W3214070287 cites W1975599459 @default.
- W3214070287 cites W1985818610 @default.
- W3214070287 cites W1993485537 @default.
- W3214070287 cites W1998630682 @default.
- W3214070287 cites W2035153735 @default.
- W3214070287 cites W2039361498 @default.
- W3214070287 cites W2042569408 @default.
- W3214070287 cites W2052179590 @default.
- W3214070287 cites W2058369414 @default.
- W3214070287 cites W2067358142 @default.
- W3214070287 cites W2067417767 @default.
- W3214070287 cites W2084690469 @default.
- W3214070287 cites W2115432992 @default.
- W3214070287 cites W2154798936 @default.
- W3214070287 cites W2316858811 @default.
- W3214070287 cites W2478362166 @default.
- W3214070287 cites W2542140666 @default.
- W3214070287 cites W2752112864 @default.
- W3214070287 cites W29710420 @default.
- W3214070287 cites W3099568133 @default.
- W3214070287 cites W3103601006 @default.
- W3214070287 cites W4210405807 @default.
- W3214070287 cites W4213311517 @default.
- W3214070287 cites W4248269519 @default.
- W3214070287 cites W4252501836 @default.
- W3214070287 doi "https://doi.org/10.1090/mcom/3695" @default.
- W3214070287 hasPublicationYear "2021" @default.
- W3214070287 type Work @default.
- W3214070287 sameAs 3214070287 @default.
- W3214070287 citedByCount "3" @default.
- W3214070287 countsByYear W32140702872021 @default.
- W3214070287 countsByYear W32140702872022 @default.
- W3214070287 crossrefType "journal-article" @default.
- W3214070287 hasAuthorship W3214070287A5012130065 @default.
- W3214070287 hasAuthorship W3214070287A5030824619 @default.
- W3214070287 hasAuthorship W3214070287A5070142343 @default.
- W3214070287 hasBestOaLocation W32140702871 @default.
- W3214070287 hasConcept C11413529 @default.
- W3214070287 hasConcept C33923547 @default.
- W3214070287 hasConcept C41008148 @default.
- W3214070287 hasConceptScore W3214070287C11413529 @default.
- W3214070287 hasConceptScore W3214070287C33923547 @default.
- W3214070287 hasConceptScore W3214070287C41008148 @default.
- W3214070287 hasFunder F4320321181 @default.
- W3214070287 hasLocation W32140702871 @default.
- W3214070287 hasLocation W32140702872 @default.
- W3214070287 hasOpenAccess W3214070287 @default.
- W3214070287 hasPrimaryLocation W32140702871 @default.
- W3214070287 hasRelatedWork W1979597421 @default.
- W3214070287 hasRelatedWork W2007980826 @default.
- W3214070287 hasRelatedWork W2351491280 @default.
- W3214070287 hasRelatedWork W2371447506 @default.
- W3214070287 hasRelatedWork W2386767533 @default.
- W3214070287 hasRelatedWork W2748952813 @default.
- W3214070287 hasRelatedWork W2899084033 @default.
- W3214070287 hasRelatedWork W303980170 @default.
- W3214070287 hasRelatedWork W3141679561 @default.
- W3214070287 hasRelatedWork W4245490552 @default.
- W3214070287 isParatext "false" @default.
- W3214070287 isRetracted "false" @default.
- W3214070287 magId "3214070287" @default.
- W3214070287 workType "article" @default.