## ag.algebraic geometry – What are the main divisors of the source specified by the Galois group for an Abelian Galois map of curves?

To let $$f: X rightarrow Y$$ be an Abelian Galois coverage of non-singular complete curves over algebraic $$k$$where the order of the Galois group $$A$$ is coprime to the characteristic of $$k$$, We can display the function field $$K (X)$$ As a $$K (Y)$$ Vector space, and through Galois theory we know its structure as $$k (A)$$ Module is given by $$K (Y) (A)$$,

Given our assumptions, we see that $$K (X)$$ has a basis of eigenvectors for $$A$$, corresponding to the various one-dimensional representations of $$A$$ about $$k$$, It has an explicit basis from $$f_ lambda in K (X)$$ so that $$g.f_ lambda = lambda (g) .f$$ to the $$lambda$$ a character of $$A$$ with value in $$k$$, So the dividers shared this $$f_ lambda$$ are canonical and we have one for each character of $$A$$,

My question is, can you describe these dividers more geometrically?

I'm vaguely aware that all coverings of this form should come from Jacobian isogenies, but my knowledge of Abelian curve coverings is not great, so excuse me if this question is really simple.

## Disable email notification for group members from SharePoint if you grant permission

We use SharePoint online. We have a group where a lot of users are added. When I try to give permission to a list by sharing the list with this group (example shown in the figure below), an email is sent to all users in this group. We do not want these emails to be sent. I know there is a checkbox in the Approved To dialog box (see the figure below) that can be used to disable notification.

A perfect solution, however, would be to disable any notification when the permission for a list or group is changed, as the administrator sometimes forgets to clear the notification check box. Is there a setting that can be turned on or off to achieve this?

Thank you very much
dev

## postgresql – Postgres 11 – * prioritizes * where clause in group

The table below is given:

``````create table cafes (
id uuid not null
constraint cafes_pkey primary key,
identity uuid not null,

is_closed boolean,
is_illegal boolean
)
``````

The problem is to choose a café from each group (grouped by `identity`), Which:

• Priority 1: has `is_closed = true`
• Priority 2: has `is_illegal = true`

That means if we have a closed café, we choose it. If there are no such cafes in the group, we look for `is_illegal = true`,

Any ideas on how to solve this problem? 🙂 🙂

## Migrate the email archive from the public Google Group to the G Suite Google Group

I have a google group that is a "public" google group whose address is `mygroup@googlegroups.com`,

I have a G Suite account and see that I can create a Google group under the G Suite account domain so that a group can have an address like `mygroup@mydomain.com`,

I want to move the public Google Group's email archive to a new Google group under my G Suite domain. Is that possible?

I found a group migration API but it would be great to do this without writing any code. We are happy to pay a fee if a company offers this as a one-time service.

## dnd 5e – How can you modify a monster to be a reasonable challenge for a level 1 group?

I prepared a one-shot adventure for my friends. It will involve a struggle with a debilitated mental patient and a huge heart that will be the boss of the adventure. The heart will conjure up bloody minions (could be anything, must match the bloody topic).

How do I change the mindflayer to be a reasonable challenge for a level 1 group, and which official monster that comes closest to a huge pulsating hearth (Mabe Gibbering Mouther?) May still work. The group will consist of four first-level characters consisting of the folk hero, the cleric, the magician, and a blush from the starter set character sheets. Thank you very much 🙂

## C # – NHibernate errors in the group of

Good morning i'm studying nibernate and you give me a mistake in the group of
but first it generates me the wrong SQL, I don't know why, follow the code below the query and the structure.

``````string hql = "select p.Categoria, count(p) " +
"from Produto p " +
"group by p.Categoria";

IQuery query = session.CreateQuery(hql);
``````

And the class structure looks like this:

``````public class Produto
{
public virtual int Id { get; set; }
public virtual string Nome { get; set; }
public virtual decimal Preco { get; set; }
public virtual Categoria Categoria { get; set; }
}

public class Categoria
{
public virtual int Id { get; set; }
public virtual string Nome { get; set; }
public virtual IList Produtos { get; set; }
}
``````

The SQL generated by NHibernate:

``````select
produto0_.CategoriaId as col_0_0_,
count(produto0_.Id) as col_1_0_,
categoria1_.Id as id1_2_,
categoria1_.Nome as nome2_2_
from
Produto produto0_
inner join
Categoria categoria1_
on produto0_.CategoriaId=categoria1_.Id
group by
produto0_.CategoriaId
``````

But the error below gives me back:

& # 39; could not run a query
(Select product0_.CategoriaId as col_0_0_, count (product0_.Id) as col_1_0_, category1_.Id as id1_2_, category1_.Name as nome2_2_ from Product product0_ inner join Category category1_ on product0_.CategoriaId = category1_.Id groupby.
(SQL: Select product0_.CategoriaId as col_0_0_, count (product0_.Id) as col_1_0_, category1_.Id as id1_2_, category1_.Name as nome2_2_ from Product product0_ inner join Category1_on product0_.CategoriaId = category1_.Id groupori.) # 39;

In my opinion that is `SQL` of `group by` I should also inform the category columns so that an error occurs, but I couldn't figure out why it is not being generated.

## Information architecture – what is the best alternative for card sorting? Group terms

Here we are planning to create an insight area for users. Insight is basically what users get from their account.

We are data analysis software. We provide information about PPC campaigns, ad groups, etc. and much more. We have other features like tracking products to get information about their competitors. So there will be 4-5 main functions.

The problem now is that it is difficult for us to solve these problems in a certain section.

Suppose there is a problem in a product / asin and that asin may have another problem related to other functions.

Can anyone say what is the best way to solve these problems?

## It cannot be checked whether a user is in a SharePoint group or not

I check whether there is a user in a certain SharePoint group or not. I shared the page with "Everyone" and "NTAUTHORITY authenticated users". Below is the code I'm using for verification.

``````function isCurrentUserInGroups(groups) {

var flag = false;
var userId = _spPageContextInfo.userId;
var requestUri = _spPageContextInfo.webAbsoluteUrl + "/_api/web/GetUserById(" + userId + ")/Groups?\$select=title";

\$.ajax({
url: requestUri,
type: "GET",
async: false,
"ACCEPT": "application/json;odata=verbose"
},
success: function (data) {

for (var i = 0; i < data.d.results.length; i++) {
for (var j = 0; j < groups.length; j++) {
if (data.d.results(i).Title == groups(j)) {
flag = true;
}
}
}
},
error: function () {
}
});
return flag;
}
``````

This code works fine when I add users directly to the group. However, does not work for users in "Everyone" and "NTAUTHORITY authenticated users". Please help.

## Can a simply connected Lie group have a non-trivial central expansion through a discrete group?

(1)
Such an extension cannot exist if you want to $$widetilde {G}$$ be connected because then $$G = widetilde {G} / Z$$ for discrete $$Z$$ implied $$Z subset pi_1G$$,

To see this, take $$z in Z$$, a base point $$tilde {x} _0 in widetilde {G}$$ and a connection curve $$tilde {x} _0$$ to $$z cdot tilde {x} _0$$, His picture is a loop in $$G$$which is not 0-homotopic. Indeed, if it was, then by homotopy lifting, the curve in $$widetilde {G}$$ would be homotopic to a point through a homotopy that repairs $$Z cdot tilde {x} _0$$ as a set. Since this set is discrete, it would have to be fixed point by point. So you get a 0-homotopy of a curve that defines both endpoints, which is absurd.

If $$widetilde {G} not = G times Z$$, then at least one connected component of $$widetilde {G}$$ is obtained from a nontrivial subset of $$Z$$ and you can apply the argument above to this component.

(2) If $$Z$$ is not discrete, then Lie group extensions correspond to Lie algebra extensions that are classified according to $$H ^ 2 ( mathfrak {g}, mathfrak {z})$$, The latter is zero for semi-simple Lie algebras according to the second Whitehead lemma.