Diameter, edge-connectivity, and C4-freeness
Improving a recent result of Fundikwa, Mazorodze, and Mukwembi, we show that $d \leq (2n-3)/5$ for every connected $C_4$-free graph of order $n$, diameter $d$, and edge-connectivity at least $3$, which is best possible up to a small additive constant. For edge-connectivity at least $4$, we improve this to $d \leq (n-3)/3$.
Vanessa Hiebeler +2 more
openaire +3 more sources
Fair assignment of indivisible objects under ordinal preferences [PDF]
We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner.
Aziz, Haris +3 more
core +4 more sources
Software fault-freeness and reliability predictions [PDF]
Many software development practices aim at ensuring that software is correct, or fault-free. In safety critical applications, requirements are in terms of probabilities of certain behaviours, e.g. as associated to the Safety Integrity Levels of IEC 61508.
A. Bertolino +10 more
core +1 more source
New characterizations of freeness for hyperplane arrangements [PDF]
In this article, we describe two new characterizations of freeness for hyperplane arrangements via the study of the generic initial ideal and of the sectional matrix of the Jacobian ideal of arrangements.
Anna Maria Bigatti +2 more
semanticscholar +1 more source
Combinatorial proofs of freeness of some P-algebras [PDF]
We present new combinatorial methods for solving algebraic problems such as computing the Hilbert series of a free $P$-algebra over one generator, or proving the freeness of a $P$-algebra.
Vincent Vong
doaj +1 more source
The freeness of Ish arrangements [PDF]
The Ish arrangement was introduced by Armstrong to give a new interpretation of the $q; t$-Catalan numbers of Garsia and Haiman. Armstrong and Rhoades showed that there are some striking similarities between the Shi arrangement and the Ish arrangement ...
Takuro Abe +2 more
doaj +1 more source
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages [PDF]
It is well known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper, we present a novel combination
Bagnara, R., Hill, P.M., Zaffanella, E.
core +10 more sources
Automaton semigroups and groups: On the undecidability of problems related to freeness and finiteness [PDF]
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton (semi)groups and ...
D. D’Angeli +2 more
semanticscholar +1 more source
Evaluation of the refining effects on the properties of transparent paper produced from bagasse fiber [PDF]
This study was conducted with the aim of producing laboratory samples of transparent paper using overbeating method. Hence, bagasse bleached soda pulp was subjected to post-bleaching sequence of DED to remove residual chromophores.
farzaneh shiralizadeh +4 more
doaj +1 more source
Freeness and The Partial Transposes of Wishart Random Matrices [PDF]
We show that the partial transposes of complex Wishart random matrices are asymptotically free. We also investigate regimes where the number of blocks is fixed but the size of the blocks increases.
J. Mingo, M. Popa
semanticscholar +1 more source

