Pseudo-repetitions are a natural generalisation of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism (anti-/morphism, for short). We approach the problem of deciding efficiently, for a word w and a literal anti-/morphism f , whether w contains an instance of a given pattern involving a variab...

In this paper, we present some studies about relations existing between well known Chomsky string grammars and graph grammars, in particularly hypergraph grammars. We are discussing about deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. A...

We study cake cutting on a graph, where agents can only evaluate their shares relative to their neighbors. This is an extension of the classical problem of fair division to incorporate the notion of social comparison from the social sciences. We say an allocation is locally envy-free if no agent envies a neighbor’s allocation, and locally proportional if each agent values its own allocation as ...

Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. We study three privacy-type properties of electronic voting protocols: in increasing order of strength, they are ...

What is a fair way to assign rooms to several housemates, and divide the rent between them? This is not just a theoretical question: many people have used the Spliddit website to obtain envy-free solutions to rent division instances. But envy freeness, in and of itself, is insufficient to guarantee outcomes that people view as intuitive and acceptable. We therefore focus on solutions that optim...

Validation and Verification of safety critical systems is crucial and if done incorrectly can result in fatal loss. The research contribution is focused on providing the transformation mechanism from software verification to source code phase of software development life cycle. Modeling of the critical systems initializes with the formalism of requirements followed by early model verification. ...

Prêt à Voter is an end-to-end verifiable voting scheme that is also receipt free. Formal method analysis was used to prove that Prêt à Voter is receipt free. In this paper we use one of the latest versions of Prêt à Voter [XCH10] to prove receipt freeness of the scheme using computational methods. We use provable security game models for the first time to prove a paper based voting scheme recei...

Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. We study three privacy-type properties of electronic voting protocols: in increasing order of strength, they are ...

We establish a relative spannedness for log canonical pairs, which is generalization of the basepoint-freeness varieties with log-terminal singularities by Andreatta--Wiśniewski. Moreover, we quasi-log pairs.

Abstract. We say that an integer n is k–free (k ≥ 2) if for every prime p the valuation vp(n) < k. If f : N → Z, we consider the enumerating function S f (x) defined as the number of positive integers n ≤ x such that f(n) is k–free. When f is the identity then S f (x) counts the k–free positive integers up to x. We review the history of S f (x) in the special cases when f is the identity, the c...