arXiv subjects

Francesca Lisi

Publications and source records attributed to Francesca Lisi.

4 recordsLinked to original sources

arXiv2025

Sylow subgroups for distinct primes and intersection of nilpotent subgroups

Let $G$ be a finite group and let $(P_i)_{i=1}^n$ be Sylow subgroups for distinct primes $p_1,\ldots,p_n$. We conjecture that there exists $x \in G$ such that $P_i \cap P_i^x$ is inclusion-minimal in $\{ P_i \cap P_i^g : g \in G\}$ for all $i$. As a first step in this direction, we show that a finite group cannot be covered by (proper) Sylow normalizers for distinct primes. Then we settle the conjecture in two opposite situations: symmetric and alternating groups of large degree and metanilpotent groups of odd order. Applications concerning the intersections of nilpotent subgroups are discussed.

math.GR↗

arXiv2024

Fixing two points in primitive solvable groups

Consider a finite primitive solvable group. We observe that a result of Y. Yang implies that there exist two points whose pointwise stabilizer has derived length at most $9$. We show that, if the group has odd cardinality, then there exist two points whose pointwise stabilizer is abelian.

math.GR↗

arXiv2022

On groups with large verbal quotients

Let $w=w(x_1,...,x_n)$ be a word, i.e. an element of the free group $F = \langle x_1,...,x_n \rangle$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{ w(x_1,...,x_n) : x_1,...,x_n \in G \}$ of all $w$-values in $G$. Following J. Gonz\'alez-S\'anchez and B. Klopsch, a group $G$ is $w$-maximal if $|H:w(H)| < |G:w(G)|$ for every $H<G$. In this paper we give new results on $w$-maximal groups, and study the weaker condition in which the previous inequality is not strict. Some applications are given: for example, if a finite group has a solvable (resp. nilpotent) section of size $n$, then it has a solvable (resp. nilpotent) subgroup of size at least $n$.

math.GR↗

arXiv2020

Proceedings 36th International Conference on Logic Programming (Technical Communications)

Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Contributions are solicited in all areas of logic programming and related areas, including but not restricted to: - Foundations: Semantics, Formalisms, Answer-Set Programming, Non-monotonic Reasoning, Knowledge Representation. - Declarative Programming: Inference engines, Analysis, Type and mode inference, Partial evaluation, Abstract interpretation, Transformation, Validation, Verification, Debugging, Profiling, Testing, Logic-based domain-specific languages, constraint handling rules. - Related Paradigms and Synergies: Inductive and Co-inductive Logic Programming, Constraint Logic Programming, Interaction with SAT, SMT and CSP solvers, Logic programming techniques for type inference and theorem proving, Argumentation, Probabilistic Logic Programming, Relations to object-oriented and Functional programming, Description logics, Neural-Symbolic Machine Learning, Hybrid Deep Learning and Symbolic Reasoning. - Implementation: Concurrency and distribution, Objects, Coordination, Mobility, Virtual machines, Compilation, Higher Order, Type systems, Modules, Constraint handling rules, Meta-programming, Foreign interfaces, User interfaces. - Applications: Databases, Big Data, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics, Education, Computational life sciences, Education, Cybersecurity, and Robotics.

cs.LO↗