Ferenc Wettl

Budapest University of Technology and Economics · Department of Algebra

Cet article traite de la localisation de TEX en Hongrie, au présent et au futur. Les auteurs passent en revue les outils nécessaires à la préparation de documents en hongrois et en particulier les améliorations nécessaires pour que TEX soit davantage prêt à l’emploi en Hongrie. Une partie du travail a déjà été accomplie et une courte liste présente...

Full paper: http://www.tug.org/TUGboat/Articles/tb23-1/bujdosowettl.pdf This paper deals with the present and future of the localization of TEX in Hungary. The authors review some of the necessary tools for preparation Hungarian documents, and especially the improvements needed to make TEX more usable in Hungary. Some of the work has been done, and...

Gallai's classical result on interval packing can be applied in VLSI routing to find, in linear time, a minimum-width dogleg-free routing in the Manhattan model, provided that all the terminals are on one side of a rectangular [1]. Should the terminals appear on two opposite sides of the rectangular, the corresponding "channel routing problem" is N...

Consider the gradually more and more complexproblems of single row routing, channel routing and switchbox routing on the one hand, and the gradually less and less restrictivemodels (1-layer, Manhattan, unconstrained 2-layer, multilayer) on the other hand. The single row routing problems can always be solved in the Manhattan model, and the channel r...

Finite geometry and combinatorics is the art of counting any phenomena that can be described by a diagram. Everyday life is full of applications; from telephones to compact disc players, from the transmission of confidential information to the codes on any item on supermarket shelves. This is a collection of thirty-five articles on covering topics...

How is the simultaneous occurrence of some phenomena (namely: an automorphism, a partial quasi-isomorphism, indistinguishable state pairs of one or another type, as they are defined by the first author and I. Babcsányi [Stud. Sci. Math. Hung. (to appear; Zbl 0724.68057)]) possible in a strongly connected automaton? Two questions of this character a...

In this paper, using recent results in finite geometry, we study a certain class of 2-level shared secret schemes. We shall present upper bounds on both the number of participants in total and on the number of participants in the lower level, which constitute the only nontrivial cases, and construct examples for the extremal cases.

This volume comprises papers presented at the Third Isle of Thorns Conference on Finite Geometries and Designs. The papers explore the structure and associated incidence structures of Galois geometries, and their related automorphism groups. Amongst the main topics covered are generalized quadrangles and n-gons, groups acting on geometries, linear...

In this paper we study subset N(K) of a set K the points of which are not in a collinear triplet of K and prove that N(K)(q+1)/2 or N(K)=K if K is a (q+1)-set of PG(2,q). We describe all the k-arcs of AG(2,q) the secants of which meet the ideal line exactly in k points.

In this paper Sperner spaces are constructed in which the affine space can be embedded in a certain sense.

A kombinatorikus optimalizálás eszközeit (gráf- és matroidelméleti algoritmusok, bonyolultságelméleti vizsgálatok) alkalmaztuk villamosságtani és informatikai problémák megoldására, így konkrétan -- a nagybonyolultságú integrált áramkörök 2- és 3-dimenziós huzalozási kérdéseire (csatorna- vagy 'switchbox'-huzalozás, minimális összhosszúságú/terület...

Megmutattuk, hogy négyzet q-ra PG(2,q)-ban 4qlog q és q^(3/2)-q+2q^(1/2) között minden méretű minimális lefogó ponthalmaz létezik, sőt egy kicsit szűkebb intervallum minden értékére q-ban több, mint polinomnyi. Magasabb dimenziós projektív terekben a hipersíkokat r modulo p pontban metsző halmazok méretére bizonyos esetekben éles alsó becslést adtu...