Akademska digitalna zbirka SLovenije - logo

Search results

Basic search    Expert search   

Currently you are NOT authorised to access e-resources SI consortium. For full access, REGISTER.

1 2
hits: 16
1.
  • Maximal connected k-subgroups of maximal rank in connected reductive algebraic k-groups
    Damian Sercombe Transactions of the American Mathematical Society. Series B, October 19, 2022, Volume: 9, Issue: 29
    Journal Article
    Peer reviewed

    Let k be any field and let G be a connected reductive algebraic k-group. Associated to G is an invariant first studied in the 1960s by Satake Ann. of Math. (2) 71 (1960), 77–110 and Tits Théorie des ...
Full text
Available for: DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, UILJ, UKNU, UL, UM, UPUK
2.
  • Maximal connected -subgroup... Maximal connected -subgroups of maximal rank in connected reductive algebraic -groups
    Sercombe, Damian Transactions of the American Mathematical Society. Series B, 10/2022, Volume: 9, Issue: 29
    Journal Article
    Peer reviewed
    Open access

    Let k k be any field and let G G be a connected reductive algebraic k k -group. Associated to G G is an invariant first studied in the 1960s by Satake Ann. of Math. (2) 71 (1960), 77–110 and Tits ...
Full text
Available for: DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, UILJ, UKNU, UL, UM, UPUK
3.
  • Random generation of associ... Random generation of associative algebras
    Sercombe, Damian; Shalev, Aner Journal of the London Mathematical Society, January 2024, 2024-01-00, Volume: 109, Issue: 1
    Journal Article
    Peer reviewed
    Open access

    There has been considerable interest in recent decades in questions of random generation of finite and profinite groups and finite simple groups in particular. In this paper, we study similar notions ...
Full text
Available for: BFBNIB, FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SAZU, SBCE, SBMB, UL, UM, UPUK
4.
  • Agency, potential and conta... Agency, potential and contagion
    Newton, Jonathan; Sercombe, Damian Games and economic behavior, January 2020, 2020-01-00, Volume: 119
    Journal Article
    Peer reviewed

    We consider two fundamental forces that can drive the diffusion of an innovation on a network. The first of these forces is potential maximization, a method of aggregating payoff incentives of ...
Full text
Available for: GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
5.
Full text
Available for: UL

PDF
6.
Full text
Available for: EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OBVAL, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
7.
  • Unipotent normal subgroups of algebraic groups
    Sercombe, Damian arXiv (Cornell University), 04/2024
    Paper, Journal Article
    Open access

    Let \(G\) be an affine algebraic group scheme over a field \(k\). We show there exists a unipotent normal subgroup of \(G\) which contains all other such subgroups; we call it the restricted ...
Full text
Available for: NUK, UL, UM, UPUK
8.
  • Maximal connected k-subgroups of maximal rank in connected reductive algebraic k-groups
    Sercombe, Damian arXiv (Cornell University), 03/2021
    Paper, Journal Article
    Open access

    Let \(k\) be any field and let \(G\) be a connected reductive algebraic \(k\)-group. Associated to \(G\) is an invariant first studied by Satake and Tits that is called the index of \(G\) (a Dynkin ...
Full text
Available for: NUK, UL, UM, UPUK
9.
  • Random generation of associative algebras
    Sercombe, Damian; Shalev, Aner arXiv (Cornell University), 03/2022
    Paper, Journal Article
    Open access

    There has been considerable interest in recent decades in questions of random generation of finite and profinite groups, and finite simple groups in particular. In this paper we study similar notions ...
Full text
Available for: NUK, UL, UM, UPUK
10.
  • The length and depth of real algebraic groups
    Sercombe, Damian arXiv (Cornell University), 11/2018
    Paper, Journal Article
    Open access

    Let \(G\) be a connected real algebraic group. An unrefinable chain of \(G\) is a chain of subgroups \(G=G_0>G_1>...>G_t=1\) where each \(G_i\) is a maximal connected real subgroup of \(G_{i-1}\). ...
Full text
Available for: NUK, UL, UM, UPUK
1 2
hits: 16

Load filters